./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9e7bf35989cde866740706d77fd71a632fd664 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 12:37:24,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:37:24,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:37:24,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:37:24,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:37:24,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:37:24,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:37:24,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:37:24,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:37:24,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:37:24,950 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:37:24,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:37:24,951 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:37:24,952 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:37:24,952 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:37:24,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:37:24,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:37:24,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:37:24,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:37:24,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:37:24,958 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:37:24,959 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:37:24,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:37:24,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:37:24,961 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:37:24,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:37:24,962 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:37:24,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:37:24,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:37:24,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:37:24,964 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:37:24,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:37:24,965 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:37:24,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:37:24,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:37:24,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:37:24,966 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 12:37:24,973 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:37:24,974 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:37:24,974 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 12:37:24,974 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 12:37:24,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:37:24,975 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:37:24,975 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 12:37:24,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:37:24,975 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 12:37:24,975 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 12:37:24,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:37:24,975 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 12:37:24,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:37:24,975 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 12:37:24,975 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 12:37:24,975 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 12:37:24,975 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 12:37:24,976 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 12:37:24,976 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:37:24,976 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:37:24,976 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 12:37:24,976 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 12:37:24,976 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 12:37:24,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 12:37:24,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:37:24,976 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 12:37:24,976 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 12:37:24,976 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 12:37:24,977 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_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd9e7bf35989cde866740706d77fd71a632fd664 [2018-12-08 12:37:24,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:37:25,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:37:25,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:37:25,007 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:37:25,007 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:37:25,007 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-08 12:37:25,046 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer/data/bff7c1dc1/7443e551776e4e2396a9820ca8111d1b/FLAG647693a4e [2018-12-08 12:37:25,511 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:37:25,511 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-08 12:37:25,517 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer/data/bff7c1dc1/7443e551776e4e2396a9820ca8111d1b/FLAG647693a4e [2018-12-08 12:37:26,026 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer/data/bff7c1dc1/7443e551776e4e2396a9820ca8111d1b [2018-12-08 12:37:26,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:37:26,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 12:37:26,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:37:26,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:37:26,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:37:26,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:37:26" (1/1) ... [2018-12-08 12:37:26,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b06587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:26, skipping insertion in model container [2018-12-08 12:37:26,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:37:26" (1/1) ... [2018-12-08 12:37:26,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:37:26,060 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:37:26,208 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:37:26,264 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:37:26,289 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:37:26,310 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:37:26,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:26 WrapperNode [2018-12-08 12:37:26,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:37:26,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:37:26,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:37:26,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:37:26,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:26" (1/1) ... [2018-12-08 12:37:26,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:26" (1/1) ... [2018-12-08 12:37:26,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:26" (1/1) ... [2018-12-08 12:37:26,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:26" (1/1) ... [2018-12-08 12:37:26,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:26" (1/1) ... [2018-12-08 12:37:26,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:26" (1/1) ... [2018-12-08 12:37:26,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:26" (1/1) ... [2018-12-08 12:37:26,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:37:26,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:37:26,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:37:26,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:37:26,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:37:26,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 12:37:26,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:37:26,373 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 12:37:26,373 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 12:37:26,373 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 12:37:26,373 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-08 12:37:26,373 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-08 12:37:26,373 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-08 12:37:26,373 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-12-08 12:37:26,374 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-12-08 12:37:26,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 12:37:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 12:37:26,375 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 12:37:26,376 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 12:37:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 12:37:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 12:37:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 12:37:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 12:37:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:37:26,639 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:37:26,639 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-08 12:37:26,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:37:26 BoogieIcfgContainer [2018-12-08 12:37:26,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:37:26,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 12:37:26,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 12:37:26,642 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 12:37:26,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 12:37:26" (1/3) ... [2018-12-08 12:37:26,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738d99c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 12:37:26, skipping insertion in model container [2018-12-08 12:37:26,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:37:26" (2/3) ... [2018-12-08 12:37:26,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738d99c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 12:37:26, skipping insertion in model container [2018-12-08 12:37:26,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:37:26" (3/3) ... [2018-12-08 12:37:26,644 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-08 12:37:26,651 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 12:37:26,656 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-12-08 12:37:26,666 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-12-08 12:37:26,681 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 12:37:26,681 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 12:37:26,681 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 12:37:26,681 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 12:37:26,681 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 12:37:26,682 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 12:37:26,682 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 12:37:26,682 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 12:37:26,682 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 12:37:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-12-08 12:37:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 12:37:26,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:26,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:37:26,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:26,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:26,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720086, now seen corresponding path program 1 times [2018-12-08 12:37:26,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:26,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:26,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:26,804 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 12:37:26,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:26,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 12:37:26,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 12:37:26,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:37:26,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:37:26,817 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2018-12-08 12:37:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:26,866 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-12-08 12:37:26,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:37:26,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 12:37:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:26,875 INFO L225 Difference]: With dead ends: 84 [2018-12-08 12:37:26,875 INFO L226 Difference]: Without dead ends: 77 [2018-12-08 12:37:26,876 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 12:37:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-08 12:37:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-08 12:37:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-08 12:37:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-12-08 12:37:26,899 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 13 [2018-12-08 12:37:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:26,899 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-12-08 12:37:26,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 12:37:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-12-08 12:37:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 12:37:26,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:26,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:37:26,900 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:26,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720085, now seen corresponding path program 1 times [2018-12-08 12:37:26,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:26,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:26,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:26,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:26,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:26,942 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 12:37:26,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:26,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 12:37:26,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 12:37:26,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:37:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:37:26,944 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 3 states. [2018-12-08 12:37:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:26,968 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-12-08 12:37:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:37:26,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 12:37:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:26,969 INFO L225 Difference]: With dead ends: 75 [2018-12-08 12:37:26,969 INFO L226 Difference]: Without dead ends: 75 [2018-12-08 12:37:26,970 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 12:37:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-08 12:37:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-08 12:37:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-08 12:37:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-12-08 12:37:26,974 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 13 [2018-12-08 12:37:26,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:26,974 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-12-08 12:37:26,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 12:37:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-08 12:37:26,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 12:37:26,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:26,975 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 12:37:26,975 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:26,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:26,975 INFO L82 PathProgramCache]: Analyzing trace with hash 303614154, now seen corresponding path program 1 times [2018-12-08 12:37:26,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:26,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:26,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:26,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:26,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:27,007 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 12:37:27,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:27,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:37:27,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:37:27,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:37:27,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:37:27,008 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-12-08 12:37:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:27,032 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-12-08 12:37:27,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:37:27,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-08 12:37:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:27,033 INFO L225 Difference]: With dead ends: 86 [2018-12-08 12:37:27,033 INFO L226 Difference]: Without dead ends: 83 [2018-12-08 12:37:27,033 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 12:37:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-08 12:37:27,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2018-12-08 12:37:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 12:37:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-12-08 12:37:27,042 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 18 [2018-12-08 12:37:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:27,042 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-12-08 12:37:27,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:37:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-12-08 12:37:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 12:37:27,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:27,042 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 12:37:27,042 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:27,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:27,043 INFO L82 PathProgramCache]: Analyzing trace with hash -677829022, now seen corresponding path program 1 times [2018-12-08 12:37:27,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:27,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:27,084 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 12:37:27,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:27,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:37:27,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:37:27,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:37:27,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:37:27,086 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 6 states. [2018-12-08 12:37:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:27,161 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-12-08 12:37:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 12:37:27,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 12:37:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:27,164 INFO L225 Difference]: With dead ends: 76 [2018-12-08 12:37:27,164 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 12:37:27,164 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 12:37:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 12:37:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-12-08 12:37:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-08 12:37:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-12-08 12:37:27,169 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 19 [2018-12-08 12:37:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:27,169 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-12-08 12:37:27,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:37:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-08 12:37:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 12:37:27,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:27,170 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 12:37:27,171 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:27,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:27,171 INFO L82 PathProgramCache]: Analyzing trace with hash -677829021, now seen corresponding path program 1 times [2018-12-08 12:37:27,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:27,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:27,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:27,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:27,225 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 12:37:27,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:27,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:37:27,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:37:27,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:37:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:37:27,226 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2018-12-08 12:37:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:27,286 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-12-08 12:37:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 12:37:27,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 12:37:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:27,287 INFO L225 Difference]: With dead ends: 75 [2018-12-08 12:37:27,287 INFO L226 Difference]: Without dead ends: 75 [2018-12-08 12:37:27,287 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 12:37:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-08 12:37:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-12-08 12:37:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 12:37:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-08 12:37:27,291 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 19 [2018-12-08 12:37:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:27,292 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-08 12:37:27,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:37:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-08 12:37:27,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 12:37:27,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:27,293 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 12:37:27,293 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:27,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash 649435046, now seen corresponding path program 1 times [2018-12-08 12:37:27,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:27,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:27,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:27,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:27,386 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 12:37:27,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:27,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 12:37:27,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 12:37:27,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 12:37:27,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 12:37:27,387 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 12 states. [2018-12-08 12:37:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:27,571 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-12-08 12:37:27,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 12:37:27,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-08 12:37:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:27,571 INFO L225 Difference]: With dead ends: 80 [2018-12-08 12:37:27,572 INFO L226 Difference]: Without dead ends: 80 [2018-12-08 12:37:27,572 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 12:37:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-08 12:37:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-12-08 12:37:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-08 12:37:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-12-08 12:37:27,575 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 31 [2018-12-08 12:37:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:27,575 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-12-08 12:37:27,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 12:37:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-12-08 12:37:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 12:37:27,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:27,576 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 12:37:27,576 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:27,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:27,576 INFO L82 PathProgramCache]: Analyzing trace with hash 649435047, now seen corresponding path program 1 times [2018-12-08 12:37:27,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:27,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:27,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:27,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:27,604 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 12:37:27,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:37:27,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:37:27,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:27,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:37:27,662 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 12:37:27,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:37:27,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-08 12:37:27,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:37:27,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:37:27,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:37:27,678 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 6 states. [2018-12-08 12:37:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:27,719 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-12-08 12:37:27,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 12:37:27,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-08 12:37:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:27,720 INFO L225 Difference]: With dead ends: 91 [2018-12-08 12:37:27,720 INFO L226 Difference]: Without dead ends: 88 [2018-12-08 12:37:27,720 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 12:37:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-08 12:37:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-12-08 12:37:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 12:37:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-12-08 12:37:27,723 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 31 [2018-12-08 12:37:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:27,724 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-12-08 12:37:27,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:37:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-12-08 12:37:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 12:37:27,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:27,725 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 12:37:27,725 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:27,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash 40947275, now seen corresponding path program 2 times [2018-12-08 12:37:27,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:27,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:27,791 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 12:37:27,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:27,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:37:27,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:37:27,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:37:27,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:37:27,792 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 6 states. [2018-12-08 12:37:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:27,825 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-12-08 12:37:27,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:37:27,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-12-08 12:37:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:27,826 INFO L225 Difference]: With dead ends: 104 [2018-12-08 12:37:27,826 INFO L226 Difference]: Without dead ends: 104 [2018-12-08 12:37:27,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:37:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-08 12:37:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2018-12-08 12:37:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-08 12:37:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-12-08 12:37:27,831 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 44 [2018-12-08 12:37:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:27,832 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-12-08 12:37:27,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:37:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-12-08 12:37:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 12:37:27,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:27,833 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 12:37:27,833 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:27,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:27,833 INFO L82 PathProgramCache]: Analyzing trace with hash 40947330, now seen corresponding path program 1 times [2018-12-08 12:37:27,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:27,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:27,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:37:27,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:27,969 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 12:37:27,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:27,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 12:37:27,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 12:37:27,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 12:37:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 12:37:27,970 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-12-08 12:37:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:28,124 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-12-08 12:37:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 12:37:28,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-12-08 12:37:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:28,125 INFO L225 Difference]: With dead ends: 99 [2018-12-08 12:37:28,125 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 12:37:28,126 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 12:37:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 12:37:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-12-08 12:37:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-08 12:37:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-12-08 12:37:28,130 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 44 [2018-12-08 12:37:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:28,130 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-12-08 12:37:28,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 12:37:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-12-08 12:37:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 12:37:28,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:28,131 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 12:37:28,131 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:28,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:28,132 INFO L82 PathProgramCache]: Analyzing trace with hash 91149112, now seen corresponding path program 1 times [2018-12-08 12:37:28,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:28,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:28,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:28,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:28,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:28,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:37:28,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:37:28,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:28,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:37:28,510 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 12:37:28,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:28,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:28,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 12:37:29,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:37:29,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:37:29,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 12:37:29,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:29,130 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 12:37:29,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-08 12:37:29,157 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 12:37:29,158 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 12:37:29,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:29,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:29,164 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 12:37:29,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:27 [2018-12-08 12:37:29,367 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 12:37:29,369 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 12:37:29,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:29,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:29,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:37:29,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:15 [2018-12-08 12:37:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:29,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:37:29,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 32 [2018-12-08 12:37:29,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-08 12:37:29,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-08 12:37:29,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=984, Unknown=2, NotChecked=0, Total=1056 [2018-12-08 12:37:29,474 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 33 states. [2018-12-08 12:37:29,945 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2018-12-08 12:37:30,487 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2018-12-08 12:37:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:32,078 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-12-08 12:37:32,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 12:37:32,079 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-12-08 12:37:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:32,080 INFO L225 Difference]: With dead ends: 118 [2018-12-08 12:37:32,080 INFO L226 Difference]: Without dead ends: 118 [2018-12-08 12:37:32,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=215, Invalid=2435, Unknown=2, NotChecked=0, Total=2652 [2018-12-08 12:37:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-08 12:37:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2018-12-08 12:37:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-08 12:37:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2018-12-08 12:37:32,084 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 47 [2018-12-08 12:37:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:32,084 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2018-12-08 12:37:32,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-08 12:37:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-12-08 12:37:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 12:37:32,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:32,085 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 12:37:32,085 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:32,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:32,085 INFO L82 PathProgramCache]: Analyzing trace with hash 91149113, now seen corresponding path program 1 times [2018-12-08 12:37:32,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:32,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:32,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:32,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:32,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:32,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:37:32,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:37:32,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:32,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:37:32,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 12:37:32,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:32,556 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 12:37:32,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:32,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:32,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 12:37:33,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:37:33,484 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 12:37:33,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:33,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:37:33,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:37:33,491 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 12:37:33,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:33,496 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 12:37:33,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-12-08 12:37:33,524 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 12:37:33,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, 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 12:37:33,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:33,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:33,534 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 12:37:33,536 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 12:37:33,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:33,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:33,542 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 12:37:33,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:36 [2018-12-08 12:37:33,787 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 12:37:33,789 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 12:37:33,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:33,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:33,798 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 12:37:33,799 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 12:37:33,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:33,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:33,804 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 12:37:33,804 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:54, output treesize:18 [2018-12-08 12:37:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:37:33,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:37:33,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 34 [2018-12-08 12:37:33,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-08 12:37:33,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-08 12:37:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1116, Unknown=2, NotChecked=0, Total=1190 [2018-12-08 12:37:33,891 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 35 states. [2018-12-08 12:37:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:36,724 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2018-12-08 12:37:36,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 12:37:36,724 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2018-12-08 12:37:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:36,725 INFO L225 Difference]: With dead ends: 151 [2018-12-08 12:37:36,725 INFO L226 Difference]: Without dead ends: 151 [2018-12-08 12:37:36,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=194, Invalid=2354, Unknown=2, NotChecked=0, Total=2550 [2018-12-08 12:37:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-08 12:37:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 114. [2018-12-08 12:37:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-08 12:37:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2018-12-08 12:37:36,731 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 47 [2018-12-08 12:37:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:36,732 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2018-12-08 12:37:36,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-08 12:37:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2018-12-08 12:37:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 12:37:36,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:36,733 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:37:36,733 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:36,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1005485962, now seen corresponding path program 2 times [2018-12-08 12:37:36,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:36,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:36,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:36,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:36,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 12:37:36,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:36,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 12:37:36,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:37:36,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:37:36,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:37:36,778 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand 7 states. [2018-12-08 12:37:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:36,827 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-12-08 12:37:36,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:37:36,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-08 12:37:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:36,828 INFO L225 Difference]: With dead ends: 90 [2018-12-08 12:37:36,828 INFO L226 Difference]: Without dead ends: 90 [2018-12-08 12:37:36,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-08 12:37:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-08 12:37:36,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-08 12:37:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-08 12:37:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-12-08 12:37:36,831 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 50 [2018-12-08 12:37:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:36,831 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-12-08 12:37:36,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:37:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-12-08 12:37:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 12:37:36,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:36,832 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:37:36,832 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:36,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:36,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1201553280, now seen corresponding path program 1 times [2018-12-08 12:37:36,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:36,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:36,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:37:36,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 12:37:36,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:36,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 12:37:36,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 12:37:36,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 12:37:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 12:37:36,889 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 12 states. [2018-12-08 12:37:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:37,029 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-12-08 12:37:37,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 12:37:37,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-12-08 12:37:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:37,030 INFO L225 Difference]: With dead ends: 95 [2018-12-08 12:37:37,030 INFO L226 Difference]: Without dead ends: 95 [2018-12-08 12:37:37,031 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 12:37:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-08 12:37:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-12-08 12:37:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-08 12:37:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-12-08 12:37:37,032 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 57 [2018-12-08 12:37:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:37,032 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-12-08 12:37:37,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 12:37:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-12-08 12:37:37,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 12:37:37,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:37,033 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:37:37,033 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:37,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1201553281, now seen corresponding path program 1 times [2018-12-08 12:37:37,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:37,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:37,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:37,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:37,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:37:37,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:37:37,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:37:37,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:37,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:37:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:37:37,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:37:37,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-08 12:37:37,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:37:37,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:37:37,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:37:37,118 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 5 states. [2018-12-08 12:37:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:37,151 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-12-08 12:37:37,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:37:37,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-08 12:37:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:37,152 INFO L225 Difference]: With dead ends: 100 [2018-12-08 12:37:37,152 INFO L226 Difference]: Without dead ends: 100 [2018-12-08 12:37:37,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:37:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-08 12:37:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-08 12:37:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 12:37:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-12-08 12:37:37,154 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 57 [2018-12-08 12:37:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:37,154 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-12-08 12:37:37,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:37:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-12-08 12:37:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 12:37:37,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:37,155 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 12:37:37,155 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:37,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash 781724054, now seen corresponding path program 1 times [2018-12-08 12:37:37,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:37,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:37,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 12:37:37,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:37,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 12:37:37,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:37:37,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:37:37,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:37:37,182 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 7 states. [2018-12-08 12:37:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:37,228 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-12-08 12:37:37,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 12:37:37,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-12-08 12:37:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:37,229 INFO L225 Difference]: With dead ends: 95 [2018-12-08 12:37:37,230 INFO L226 Difference]: Without dead ends: 95 [2018-12-08 12:37:37,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-08 12:37:37,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-08 12:37:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-08 12:37:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-08 12:37:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-12-08 12:37:37,232 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 58 [2018-12-08 12:37:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:37,232 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-12-08 12:37:37,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:37:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-12-08 12:37:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 12:37:37,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:37,233 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 12:37:37,233 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:37,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash 456093685, now seen corresponding path program 2 times [2018-12-08 12:37:37,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:37,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:37,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:37,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:37,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 12:37:37,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:37:37,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:37:37,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:37:37,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:37:37,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:37:37,259 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 6 states. [2018-12-08 12:37:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:37,292 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-12-08 12:37:37,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:37:37,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-08 12:37:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:37,293 INFO L225 Difference]: With dead ends: 109 [2018-12-08 12:37:37,294 INFO L226 Difference]: Without dead ends: 109 [2018-12-08 12:37:37,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:37:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-08 12:37:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-08 12:37:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-08 12:37:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2018-12-08 12:37:37,297 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 65 [2018-12-08 12:37:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:37,297 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2018-12-08 12:37:37,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:37:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2018-12-08 12:37:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 12:37:37,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:37,297 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 12:37:37,298 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:37,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:37,298 INFO L82 PathProgramCache]: Analyzing trace with hash 456093740, now seen corresponding path program 1 times [2018-12-08 12:37:37,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:37,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:37,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:37,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:37:37,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:37,438 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 12:37:37,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:37:37,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:37:37,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:37,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:37:37,478 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 12:37:37,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:37,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:37,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 12:37:37,698 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 12:37:37,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 12:37:37,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2018-12-08 12:37:37,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-08 12:37:37,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-08 12:37:37,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-12-08 12:37:37,723 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 28 states. [2018-12-08 12:37:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:38,115 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-12-08 12:37:38,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 12:37:38,116 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2018-12-08 12:37:38,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:38,116 INFO L225 Difference]: With dead ends: 111 [2018-12-08 12:37:38,117 INFO L226 Difference]: Without dead ends: 111 [2018-12-08 12:37:38,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2018-12-08 12:37:38,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-08 12:37:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2018-12-08 12:37:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-08 12:37:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2018-12-08 12:37:38,120 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 65 [2018-12-08 12:37:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:38,120 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2018-12-08 12:37:38,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-08 12:37:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2018-12-08 12:37:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 12:37:38,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:38,121 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 12:37:38,121 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:38,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:38,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1787915394, now seen corresponding path program 1 times [2018-12-08 12:37:38,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:38,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:38,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:38,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:38,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 12:37:38,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:37:38,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:37:38,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:37:38,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:37:38,606 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 12:37:38,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:38,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:38,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 12:37:38,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:37:38,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:37:38,680 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 12:37:38,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:38,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:38,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-08 12:37:38,718 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 12:37:38,719 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 12:37:38,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:38,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:38,723 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 12:37:38,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-12-08 12:37:40,959 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-08 12:37:40,964 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 12:37:40,966 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 12:37:40,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:40,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:40,974 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 12:37:40,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:22 [2018-12-08 12:37:41,003 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 12:37:41,004 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 12:37:41,004 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 12:37:41,007 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 12:37:41,010 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 12:37:41,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2018-12-08 12:37:54,421 WARN L180 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-08 12:37:54,426 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 12:37:54,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:37:54,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 12:37:54,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:54,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:54,438 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 12:37:54,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-08 12:37:54,535 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 12:37:54,536 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 12:37:54,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:37:54,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:37:54,546 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 12:37:54,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:5 [2018-12-08 12:37:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 12:37:54,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:37:54,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 49 [2018-12-08 12:37:54,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-08 12:37:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-08 12:37:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2306, Unknown=13, NotChecked=0, Total=2450 [2018-12-08 12:37:54,608 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 50 states. [2018-12-08 12:37:56,164 WARN L180 SmtUtils]: Spent 839.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-08 12:37:59,069 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-08 12:37:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:37:59,713 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-12-08 12:37:59,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-08 12:37:59,713 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 68 [2018-12-08 12:37:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:37:59,714 INFO L225 Difference]: With dead ends: 134 [2018-12-08 12:37:59,714 INFO L226 Difference]: Without dead ends: 134 [2018-12-08 12:37:59,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=383, Invalid=5006, Unknown=13, NotChecked=0, Total=5402 [2018-12-08 12:37:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-08 12:37:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2018-12-08 12:37:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-08 12:37:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2018-12-08 12:37:59,717 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 68 [2018-12-08 12:37:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:37:59,717 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2018-12-08 12:37:59,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-08 12:37:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2018-12-08 12:37:59,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 12:37:59,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:37:59,717 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 12:37:59,717 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:37:59,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:37:59,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1787915393, now seen corresponding path program 1 times [2018-12-08 12:37:59,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:37:59,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:37:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:59,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:37:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:37:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:38:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 12:38:00,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:38:00,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:38:00,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:38:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:38:00,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:38:00,434 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 12:38:00,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:38:00,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:38:00,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 12:38:00,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:38:00,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:38:00,657 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 12:38:00,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:38:00,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:38:00,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 12:38:00,712 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 12:38:00,714 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 12:38:00,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:38:00,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:38:00,722 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 12:38:00,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 12:38:00,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:38:00,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:38:00,729 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 12:38:00,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-12-08 12:38:01,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-12-08 12:38:01,120 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 12:38:01,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:38:01,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:38:01,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-12-08 12:38:01,155 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 12:38:01,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:38:01,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:38:01,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:38:01,172 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:108, output treesize:39 [2018-12-08 12:38:01,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-08 12:38:01,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-12-08 12:38:01,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:38:01,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:38:01,298 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 12:38:01,301 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 12:38:01,302 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 12:38:01,306 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 12:38:01,313 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 12:38:01,314 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:12 [2018-12-08 12:39:29,518 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-08 12:39:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-12-08 12:39:29,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:39:29,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-12-08 12:39:29,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:29,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:29,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-12-08 12:39:29,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:39:29,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-12-08 12:39:29,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:29,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:29,557 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 12:39:29,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:44 [2018-12-08 12:39:29,688 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 12:39:29,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-12-08 12:39:29,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:29,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:29,699 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 12:39:29,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-12-08 12:39:29,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:29,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:29,706 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 12:39:29,706 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:11 [2018-12-08 12:39:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 12:39:29,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:39:29,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 57 [2018-12-08 12:39:29,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-08 12:39:29,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-08 12:39:29,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3101, Unknown=38, NotChecked=0, Total=3306 [2018-12-08 12:39:29,804 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 58 states. [2018-12-08 12:39:33,327 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 34 [2018-12-08 12:39:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:39:34,401 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2018-12-08 12:39:34,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-08 12:39:34,402 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 68 [2018-12-08 12:39:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:39:34,403 INFO L225 Difference]: With dead ends: 137 [2018-12-08 12:39:34,403 INFO L226 Difference]: Without dead ends: 137 [2018-12-08 12:39:34,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 93.0s TimeCoverageRelationStatistics Valid=466, Invalid=5976, Unknown=38, NotChecked=0, Total=6480 [2018-12-08 12:39:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-08 12:39:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-12-08 12:39:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-08 12:39:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-12-08 12:39:34,408 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 68 [2018-12-08 12:39:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:39:34,408 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-12-08 12:39:34,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-08 12:39:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-12-08 12:39:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 12:39:34,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:39:34,409 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:39:34,409 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:39:34,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:39:34,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1896395852, now seen corresponding path program 2 times [2018-12-08 12:39:34,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:39:34,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:39:34,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:34,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:39:34,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 12:39:34,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:39:34,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 12:39:34,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:39:34,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:39:34,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:39:34,439 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 7 states. [2018-12-08 12:39:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:39:34,469 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-12-08 12:39:34,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:39:34,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-08 12:39:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:39:34,470 INFO L225 Difference]: With dead ends: 98 [2018-12-08 12:39:34,470 INFO L226 Difference]: Without dead ends: 98 [2018-12-08 12:39:34,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-08 12:39:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-08 12:39:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-08 12:39:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 12:39:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-12-08 12:39:34,472 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 71 [2018-12-08 12:39:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:39:34,472 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-12-08 12:39:34,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:39:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-12-08 12:39:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 12:39:34,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:39:34,473 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 12:39:34,473 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:39:34,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:39:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1466991259, now seen corresponding path program 1 times [2018-12-08 12:39:34,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:39:34,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:39:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:34,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:39:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-08 12:39:34,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:39:34,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:39:34,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:39:34,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:39:34,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:39:34,516 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 7 states. [2018-12-08 12:39:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:39:34,593 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-12-08 12:39:34,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 12:39:34,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-12-08 12:39:34,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:39:34,594 INFO L225 Difference]: With dead ends: 113 [2018-12-08 12:39:34,594 INFO L226 Difference]: Without dead ends: 113 [2018-12-08 12:39:34,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 12:39:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-08 12:39:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-12-08 12:39:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-08 12:39:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-12-08 12:39:34,597 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 90 [2018-12-08 12:39:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:39:34,597 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-12-08 12:39:34,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:39:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-12-08 12:39:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 12:39:34,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:39:34,598 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 12:39:34,598 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:39:34,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:39:34,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1466991260, now seen corresponding path program 1 times [2018-12-08 12:39:34,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:39:34,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:39:34,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:34,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:39:34,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:34,755 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 12:39:34,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:39:34,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:39:34,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:39:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:34,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:39:34,806 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 12:39:34,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:34,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:34,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 12:39:35,042 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 12:39:35,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 12:39:35,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2018-12-08 12:39:35,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-08 12:39:35,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-08 12:39:35,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-08 12:39:35,057 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 26 states. [2018-12-08 12:39:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:39:35,321 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-12-08 12:39:35,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 12:39:35,321 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 90 [2018-12-08 12:39:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:39:35,321 INFO L225 Difference]: With dead ends: 105 [2018-12-08 12:39:35,321 INFO L226 Difference]: Without dead ends: 105 [2018-12-08 12:39:35,322 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 12:39:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-08 12:39:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-12-08 12:39:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-08 12:39:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-08 12:39:35,323 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 90 [2018-12-08 12:39:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:39:35,324 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-08 12:39:35,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-08 12:39:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-08 12:39:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 12:39:35,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:39:35,324 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 12:39:35,324 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:39:35,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:39:35,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1842980103, now seen corresponding path program 1 times [2018-12-08 12:39:35,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:39:35,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:39:35,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:35,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:39:35,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:35,407 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 12:39:35,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:39:35,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 12:39:35,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 12:39:35,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 12:39:35,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 12:39:35,408 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 12 states. [2018-12-08 12:39:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:39:35,502 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-12-08 12:39:35,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 12:39:35,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-08 12:39:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:39:35,503 INFO L225 Difference]: With dead ends: 104 [2018-12-08 12:39:35,503 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 12:39:35,503 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 12:39:35,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 12:39:35,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-12-08 12:39:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-08 12:39:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-12-08 12:39:35,504 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 93 [2018-12-08 12:39:35,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:39:35,505 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-12-08 12:39:35,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 12:39:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-12-08 12:39:35,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 12:39:35,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:39:35,505 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 12:39:35,505 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:39:35,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:39:35,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1382814895, now seen corresponding path program 1 times [2018-12-08 12:39:35,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:39:35,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:39:35,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:35,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:39:35,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 12:39:36,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:39:36,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:39:36,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:39:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:36,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:39:36,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 6 treesize of output 5 [2018-12-08 12:39:36,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 12:39:36,359 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 12:39:36,360 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 12:39:36,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,368 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 12:39:36,369 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 12:39:36,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-08 12:39:36,407 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 12:39:36,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:39:36,411 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 12:39:36,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,424 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 12:39:36,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:39:36,427 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 12:39:36,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:30 [2018-12-08 12:39:36,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:39:36,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:39:36,501 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 12:39:36,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-08 12:39:36,579 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 12:39:36,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-08 12:39:36,582 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 12:39:36,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-08 12:39:36,597 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 12:39:36,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:36,605 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:26 [2018-12-08 12:39:39,044 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 30 [2018-12-08 12:39:39,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-12-08 12:39:39,054 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 12:39:39,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-12-08 12:39:39,075 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 12:39:39,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:37 [2018-12-08 12:39:39,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-08 12:39:39,127 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 12:39:39,127 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 12:39:39,130 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 12:39:39,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-08 12:39:39,141 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 12:39:39,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,150 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 12:39:39,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:12 [2018-12-08 12:39:39,306 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 12:39:39,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:39:39,310 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 12:39:39,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,328 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 12:39:39,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:39:39,332 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 12:39:39,332 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,342 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 12:39:39,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:72, output treesize:42 [2018-12-08 12:39:39,738 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 12:39:39,743 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 12:39:39,744 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 12:39:39,751 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 12:39:39,764 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 12:39:39,769 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 12:39:39,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 12:39:39,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:39:39,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 12:39:39,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:74 [2018-12-08 12:39:39,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:39:39,992 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 12:39:39,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:39,997 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 12:39:39,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-12-08 12:39:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 12:39:40,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:39:40,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 37] total 65 [2018-12-08 12:39:40,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-08 12:39:40,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-08 12:39:40,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4090, Unknown=5, NotChecked=0, Total=4290 [2018-12-08 12:39:40,119 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 66 states. [2018-12-08 12:39:43,633 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-08 12:39:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:39:47,256 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-12-08 12:39:47,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-08 12:39:47,257 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 95 [2018-12-08 12:39:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:39:47,257 INFO L225 Difference]: With dead ends: 115 [2018-12-08 12:39:47,257 INFO L226 Difference]: Without dead ends: 115 [2018-12-08 12:39:47,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=516, Invalid=8032, Unknown=8, NotChecked=0, Total=8556 [2018-12-08 12:39:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-08 12:39:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2018-12-08 12:39:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-08 12:39:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-12-08 12:39:47,261 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 95 [2018-12-08 12:39:47,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:39:47,261 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-12-08 12:39:47,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-08 12:39:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-12-08 12:39:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 12:39:47,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:39:47,262 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 12:39:47,262 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:39:47,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:39:47,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1382814894, now seen corresponding path program 1 times [2018-12-08 12:39:47,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:39:47,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:39:47,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:47,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:39:47,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:39:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 12:39:48,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:39:48,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:39:48,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:39:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:39:48,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:39:48,781 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 12:39:48,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:48,786 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 12:39:48,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:48,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:48,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 12:39:49,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:39:49,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:39:49,082 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 12:39:49,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:49,089 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 12:39:49,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:49,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:49,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-12-08 12:39:49,178 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 12:39:49,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 10 treesize of output 9 [2018-12-08 12:39:49,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:49,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:49,194 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 12:39:49,195 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 12:39:49,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:49,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:49,205 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 12:39:49,205 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:51 [2018-12-08 12:39:49,448 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 12:39:49,450 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 12:39:49,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:39:49,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:39:49,458 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 12:39:49,460 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 12:39:49,460 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 12:39:49,463 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 12:39:49,469 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 12:39:49,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-12-08 12:40:17,422 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-08 12:40:17,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-12-08 12:40:17,434 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 12:40:17,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:40:17,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:40:17,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-12-08 12:40:17,459 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 12:40:17,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:40:17,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:40:17,472 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 12:40:17,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:131, output treesize:65 [2018-12-08 12:40:17,526 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 12:40:17,527 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 12:40:17,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:40:17,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:40:17,536 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 12:40:17,537 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 12:40:17,537 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 12:40:17,540 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 12:40:17,546 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 12:40:17,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-12-08 12:40:46,682 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-08 12:40:46,690 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 12:40:46,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:40:46,695 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 12:40:46,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:40:46,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:40:46,719 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 12:40:46,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:40:46,723 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 12:40:46,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:40:46,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:40:46,741 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 12:40:46,741 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:65 [2018-12-08 12:40:47,124 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 12:40:47,129 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 12:40:47,129 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 12:40:47,136 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 12:40:47,151 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 12:40:47,156 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 12:40:47,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 12:40:47,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:40:47,174 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 12:40:47,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:100 [2018-12-08 12:40:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 12:40:47,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:40:47,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 65 [2018-12-08 12:40:47,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-08 12:40:47,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-08 12:40:47,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4062, Unknown=21, NotChecked=0, Total=4290 [2018-12-08 12:40:47,493 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 66 states. [2018-12-08 12:41:30,383 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 43 [2018-12-08 12:41:44,815 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 40 [2018-12-08 12:42:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:42:46,253 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-12-08 12:42:46,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-08 12:42:46,253 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 95 [2018-12-08 12:42:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:42:46,254 INFO L225 Difference]: With dead ends: 117 [2018-12-08 12:42:46,254 INFO L226 Difference]: Without dead ends: 117 [2018-12-08 12:42:46,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 65.4s TimeCoverageRelationStatistics Valid=600, Invalid=8121, Unknown=21, NotChecked=0, Total=8742 [2018-12-08 12:42:46,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-08 12:42:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2018-12-08 12:42:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-08 12:42:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-12-08 12:42:46,257 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 95 [2018-12-08 12:42:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:42:46,258 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-12-08 12:42:46,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-08 12:42:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-12-08 12:42:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 12:42:46,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:42:46,258 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 12:42:46,259 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:42:46,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:42:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1886386321, now seen corresponding path program 1 times [2018-12-08 12:42:46,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:42:46,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:42:46,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:42:46,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:42:46,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:42:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 12:42:46,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:42:46,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:42:46,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:42:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:42:46,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:42:47,171 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 12:42:47,174 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 12:42:47,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:42:47,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:42:47,197 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 12:42:47,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:57 [2018-12-08 12:42:47,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:42:47,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-08 12:42:47,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:42:47,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-12-08 12:42:47,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:42:47,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:42:47,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-08 12:42:47,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-12-08 12:42:47,519 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 12:42:47,522 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 12:42:47,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 12:42:47,532 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:22 [2018-12-08 12:43:00,731 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-08 12:43:00,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:00,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 88 [2018-12-08 12:43:00,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-08 12:43:00,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:00,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:00,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:00,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:75 [2018-12-08 12:43:00,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:00,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-08 12:43:00,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:00,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-12-08 12:43:00,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:00,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:00,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-08 12:43:00,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-12-08 12:43:00,847 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 12:43:00,851 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 12:43:00,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:00,857 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:22 [2018-12-08 12:43:00,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-12-08 12:43:00,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:00,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2018-12-08 12:43:00,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:00,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:00,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:00,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:75 [2018-12-08 12:43:01,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:01,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-08 12:43:01,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-12-08 12:43:01,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:01,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:01,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:01,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:43 [2018-12-08 12:43:01,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:01,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-08 12:43:01,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:01,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-12-08 12:43:01,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:01,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:01,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:01,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:43 [2018-12-08 12:43:01,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-12-08 12:43:01,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:01,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:01,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:30 [2018-12-08 12:43:03,712 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-12-08 12:43:05,774 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2018-12-08 12:43:05,777 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 12:43:05,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:05,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:05,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:90, output treesize:1 [2018-12-08 12:43:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 12:43:05,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:43:05,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 62 [2018-12-08 12:43:05,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-08 12:43:05,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-08 12:43:05,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3571, Unknown=7, NotChecked=0, Total=3782 [2018-12-08 12:43:05,822 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 62 states. [2018-12-08 12:43:13,907 WARN L180 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-08 12:43:24,673 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-08 12:43:26,723 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-08 12:43:28,135 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-08 12:43:28,600 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-12-08 12:43:34,998 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-08 12:43:35,395 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-08 12:43:35,673 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-08 12:43:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:43:35,694 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2018-12-08 12:43:35,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-08 12:43:35,695 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 98 [2018-12-08 12:43:35,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:43:35,695 INFO L225 Difference]: With dead ends: 172 [2018-12-08 12:43:35,695 INFO L226 Difference]: Without dead ends: 170 [2018-12-08 12:43:35,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=655, Invalid=9037, Unknown=10, NotChecked=0, Total=9702 [2018-12-08 12:43:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-08 12:43:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 106. [2018-12-08 12:43:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-08 12:43:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-12-08 12:43:35,698 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 98 [2018-12-08 12:43:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:43:35,698 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-12-08 12:43:35,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-08 12:43:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-12-08 12:43:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 12:43:35,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:43:35,699 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 12:43:35,699 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:43:35,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:43:35,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1675854939, now seen corresponding path program 2 times [2018-12-08 12:43:35,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:43:35,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:43:35,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:43:35,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:43:35,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:43:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:37,450 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 12:43:37,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:43:37,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:43:37,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 12:43:37,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 12:43:37,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 12:43:37,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:37,504 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 12:43:37,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 12:43:37,552 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 12:43:37,553 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 12:43:37,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,561 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 12:43:37,562 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 12:43:37,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,568 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-08 12:43:37,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:37,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:37,845 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 12:43:37,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,863 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 12:43:37,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, 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 12:43:37,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:37,869 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 12:43:37,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,877 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-08 12:43:37,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-08 12:43:37,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:37,896 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 12:43:37,896 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,899 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,902 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:37,910 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 12:43:37,910 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:78, output treesize:50 [2018-12-08 12:43:38,022 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 12:43:38,023 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 12:43:38,024 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 12:43:38,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,041 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 12:43:38,043 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 12:43:38,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:56 [2018-12-08 12:43:38,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:38,320 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 12:43:38,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 142 [2018-12-08 12:43:38,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:38,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-12-08 12:43:38,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:38,346 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 12:43:38,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 78 [2018-12-08 12:43:38,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:38,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-12-08 12:43:38,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:143, output treesize:53 [2018-12-08 12:43:38,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-08 12:43:38,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:38,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 64 [2018-12-08 12:43:38,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,494 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 12:43:38,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:38,497 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 12:43:38,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:53 [2018-12-08 12:43:38,969 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 12:43:38,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:38,975 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 12:43:38,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:62 [2018-12-08 12:43:39,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:39,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:39,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-08 12:43:39,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:39,051 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 12:43:39,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-12-08 12:43:39,055 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 12:43:39,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-08 12:43:39,056 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 12:43:39,066 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 12:43:39,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 12:43:39,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 12:43:39,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-12-08 12:43:39,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:39,088 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 12:43:39,089 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:39,091 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:39,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-12-08 12:43:39,104 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 12:43:39,104 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-08 12:43:39,109 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:43:39,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:43:39,118 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-12-08 12:43:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 12:43:39,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:43:39,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 58 [2018-12-08 12:43:39,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-08 12:43:39,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-08 12:43:39,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3108, Unknown=2, NotChecked=0, Total=3306 [2018-12-08 12:43:39,248 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 58 states. [2018-12-08 12:43:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:43:42,539 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2018-12-08 12:43:42,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-08 12:43:42,540 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 100 [2018-12-08 12:43:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:43:42,541 INFO L225 Difference]: With dead ends: 184 [2018-12-08 12:43:42,541 INFO L226 Difference]: Without dead ends: 184 [2018-12-08 12:43:42,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 64 SyntacticMatches, 25 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=524, Invalid=6956, Unknown=2, NotChecked=0, Total=7482 [2018-12-08 12:43:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-08 12:43:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 168. [2018-12-08 12:43:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-08 12:43:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-12-08 12:43:42,548 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 100 [2018-12-08 12:43:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:43:42,549 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-12-08 12:43:42,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-08 12:43:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-12-08 12:43:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:43:42,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:43:42,550 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 12:43:42,550 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:43:42,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:43:42,551 INFO L82 PathProgramCache]: Analyzing trace with hash 693259079, now seen corresponding path program 2 times [2018-12-08 12:43:42,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:43:42,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:43:42,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:43:42,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:43:42,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:43:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:43:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 12:43:43,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:43:43,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:43:43,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 12:43:43,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 12:43:43,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 12:43:43,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:43:43,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:43,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:43,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-12-08 12:43:43,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 12:43:43,793 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 12:43:43,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:43,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:43,804 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 12:43:43,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-12-08 12:43:44,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:44,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-08 12:43:44,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:44,284 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 12:43:44,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:44,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:44,297 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 12:43:44,299 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 12:43:44,299 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 12:43:44,303 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 12:43:44,309 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 12:43:44,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2018-12-08 12:43:58,630 WARN L180 SmtUtils]: Spent 714.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-08 12:43:58,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 71 [2018-12-08 12:43:58,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:58,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:58,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 61 [2018-12-08 12:43:58,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 12:43:58,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2018-12-08 12:43:58,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:58,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 12:43:58,764 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 12:43:58,764 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:89, output treesize:116 [2018-12-08 12:43:58,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:58,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-12-08 12:43:58,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-12-08 12:43:58,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:58,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:58,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:58,939 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 12:43:58,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:43:58,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-12-08 12:43:58,941 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:58,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:58,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-08 12:43:58,964 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 12:43:58,965 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 12:43:58,970 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:43:58,981 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 12:43:58,982 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 12:43:58,982 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:58,986 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 12:43:58,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 12:43:58,996 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:92, output treesize:37 [2018-12-08 12:44:07,526 WARN L180 SmtUtils]: Spent 949.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-08 12:44:07,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 65 [2018-12-08 12:44:07,541 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 12:44:07,541 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 12:44:07,563 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 12:44:07,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-12-08 12:44:07,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:07,637 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 12:44:07,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:07,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:07,710 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 12:44:07,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:150, output treesize:161 [2018-12-08 12:44:07,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:07,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-12-08 12:44:07,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:07,932 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 12:44:07,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:07,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:07,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:07,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-12-08 12:44:07,962 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 12:44:07,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:07,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:07,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:07,987 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 12:44:07,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:07,989 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 12:44:07,990 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:07,994 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:08,011 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 12:44:08,011 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-12-08 12:44:08,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:08,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-12-08 12:44:08,242 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 12:44:08,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:08,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:08,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:08,271 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 12:44:08,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:08,273 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 12:44:08,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:08,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:08,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:08,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-12-08 12:44:08,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:44:08,297 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 12:44:08,297 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:08,301 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:44:08,316 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 12:44:08,317 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-12-08 12:44:08,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 12:44:08,792 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 12:44:08,793 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 12:44:08,793 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 12:44:08,798 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 12:44:08,804 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 12:44:08,804 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:26 [2018-12-08 12:44:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 12:44:19,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:44:19,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 58 [2018-12-08 12:44:19,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-08 12:44:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-08 12:44:19,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3185, Unknown=32, NotChecked=0, Total=3422 [2018-12-08 12:44:19,386 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 59 states. [2018-12-08 12:44:29,774 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-08 12:44:31,674 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-08 12:44:35,443 WARN L180 SmtUtils]: Spent 709.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-08 12:44:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:44:35,865 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-12-08 12:44:35,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-08 12:44:35,865 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 103 [2018-12-08 12:44:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:44:35,866 INFO L225 Difference]: With dead ends: 197 [2018-12-08 12:44:35,866 INFO L226 Difference]: Without dead ends: 135 [2018-12-08 12:44:35,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 78 SyntacticMatches, 13 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=496, Invalid=6612, Unknown=32, NotChecked=0, Total=7140 [2018-12-08 12:44:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-08 12:44:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2018-12-08 12:44:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-08 12:44:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2018-12-08 12:44:35,870 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 103 [2018-12-08 12:44:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:44:35,871 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2018-12-08 12:44:35,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-08 12:44:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-12-08 12:44:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 12:44:35,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:44:35,872 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 12:44:35,872 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-08 12:44:35,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:44:35,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1054346185, now seen corresponding path program 3 times [2018-12-08 12:44:35,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:44:35,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:44:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:35,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:44:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:44:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:44:35,911 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 12:44:35,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:44:35,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/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 12:44:35,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 12:44:36,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 12:44:36,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 12:44:36,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:44:36,037 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 12:44:36,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:44:36,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-08 12:44:36,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:44:36,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:44:36,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:44:36,054 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 7 states. [2018-12-08 12:44:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:44:36,082 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-12-08 12:44:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:44:36,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-08 12:44:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:44:36,083 INFO L225 Difference]: With dead ends: 44 [2018-12-08 12:44:36,083 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 12:44:36,083 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 12:44:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 12:44:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 12:44:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 12:44:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 12:44:36,083 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-12-08 12:44:36,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:44:36,083 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:44:36,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:44:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 12:44:36,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 12:44:36,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 12:44:36 BoogieIcfgContainer [2018-12-08 12:44:36,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 12:44:36,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:44:36,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:44:36,087 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:44:36,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:37:26" (3/4) ... [2018-12-08 12:44:36,090 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 12:44:36,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 12:44:36,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-08 12:44:36,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-12-08 12:44:36,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2018-12-08 12:44:36,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-08 12:44:36,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-08 12:44:36,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-12-08 12:44:36,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2018-12-08 12:44:36,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 12:44:36,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-08 12:44:36,098 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-08 12:44:36,099 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-08 12:44:36,099 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 12:44:36,126 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c990b3cb-e131-416e-b746-595023d2c790/bin-2019/uautomizer/witness.graphml [2018-12-08 12:44:36,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:44:36,127 INFO L168 Benchmark]: Toolchain (without parser) took 430098.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 950.6 MB in the beginning and 958.7 MB in the end (delta: -8.1 MB). Peak memory consumption was 157.6 MB. Max. memory is 11.5 GB. [2018-12-08 12:44:36,127 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 12:44:36,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-08 12:44:36,128 INFO L168 Benchmark]: Boogie Preprocessor took 31.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 12:44:36,128 INFO L168 Benchmark]: RCFGBuilder took 297.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2018-12-08 12:44:36,128 INFO L168 Benchmark]: TraceAbstraction took 429446.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.1 MB). Free memory was 1.1 GB in the beginning and 965.3 MB in the end (delta: 96.1 MB). Peak memory consumption was 130.2 MB. Max. memory is 11.5 GB. [2018-12-08 12:44:36,128 INFO L168 Benchmark]: Witness Printer took 39.70 ms. Allocated memory is still 1.2 GB. Free memory was 965.3 MB in the beginning and 958.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-08 12:44:36,129 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 281.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 297.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 429446.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.1 MB). Free memory was 1.1 GB in the beginning and 965.3 MB in the end (delta: 96.1 MB). Peak memory consumption was 130.2 MB. Max. memory is 11.5 GB. * Witness Printer took 39.70 ms. Allocated memory is still 1.2 GB. Free memory was 965.3 MB in the beginning and 958.7 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: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 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: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 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 - 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 - 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, 429.4s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 192.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1791 SDtfs, 2631 SDslu, 14231 SDs, 0 SdLazy, 26396 SolverSat, 755 SolverUnsat, 80 SolverUnknown, 0 SolverNotchecked, 150.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1843 GetRequests, 861 SyntacticMatches, 87 SemanticMatches, 895 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12471 ImplicationChecksByTransitivity, 269.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 279 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 235.2s InterpolantComputationTime, 2839 NumberOfCodeBlocks, 2839 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2796 ConstructedInterpolants, 308 QuantifiedInterpolants, 3120418 SizeOfPredicates, 254 NumberOfNonLiveVariables, 4979 ConjunctsInSsa, 979 ConjunctsInUnsatCore, 43 InterpolantComputations, 17 PerfectInterpolantSequences, 807/1206 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...