./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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 a3189d7d4e71631c5441bd903e5049703e07b8be ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:57:58,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:57:58,315 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:57:58,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:57:58,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:57:58,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:57:58,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:57:58,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:57:58,330 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:57:58,330 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:57:58,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:57:58,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:57:58,332 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:57:58,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:57:58,334 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:57:58,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:57:58,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:57:58,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:57:58,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:57:58,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:57:58,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:57:58,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:57:58,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:57:58,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:57:58,344 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:57:58,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:57:58,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:57:58,346 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:57:58,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:57:58,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:57:58,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:57:58,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:57:58,348 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:57:58,349 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:57:58,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:57:58,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:57:58,351 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 12:57:58,362 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:57:58,362 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:57:58,363 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:57:58,363 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:57:58,363 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:57:58,363 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:57:58,363 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:57:58,364 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:57:58,364 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:57:58,364 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:57:58,364 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:57:58,364 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:57:58,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:57:58,364 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 12:57:58,365 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 12:57:58,365 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 12:57:58,365 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:57:58,365 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:57:58,365 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:57:58,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:57:58,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:57:58,367 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:57:58,368 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:57:58,368 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:57:58,368 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:57:58,368 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:57:58,368 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:57:58,368 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:57:58,368 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_89af2569-36fb-4e59-8c29-d78c05bd3a17/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 -> a3189d7d4e71631c5441bd903e5049703e07b8be [2018-11-28 12:57:58,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:57:58,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:57:58,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:57:58,410 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:57:58,411 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:57:58,411 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:57:58,460 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/bin-2019/uautomizer/data/0858de9dc/11b4c99c91564ba19ff1396626577f9e/FLAG6e38c649b [2018-11-28 12:57:58,847 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:57:58,848 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:57:58,856 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/bin-2019/uautomizer/data/0858de9dc/11b4c99c91564ba19ff1396626577f9e/FLAG6e38c649b [2018-11-28 12:57:59,222 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/bin-2019/uautomizer/data/0858de9dc/11b4c99c91564ba19ff1396626577f9e [2018-11-28 12:57:59,225 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:57:59,226 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 12:57:59,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:57:59,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:57:59,229 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:57:59,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:57:59" (1/1) ... [2018-11-28 12:57:59,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff08168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:57:59, skipping insertion in model container [2018-11-28 12:57:59,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:57:59" (1/1) ... [2018-11-28 12:57:59,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:57:59,266 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:57:59,467 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:57:59,476 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:57:59,552 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:57:59,583 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:57:59,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:57:59 WrapperNode [2018-11-28 12:57:59,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:57:59,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:57:59,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:57:59,584 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:57:59,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:57:59" (1/1) ... [2018-11-28 12:57:59,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:57:59" (1/1) ... [2018-11-28 12:57:59,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:57:59" (1/1) ... [2018-11-28 12:57:59,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:57:59" (1/1) ... [2018-11-28 12:57:59,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:57:59" (1/1) ... [2018-11-28 12:57:59,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:57:59" (1/1) ... [2018-11-28 12:57:59,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:57:59" (1/1) ... [2018-11-28 12:57:59,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:57:59,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:57:59,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:57:59,626 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:57:59,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:57:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:57:59,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:57:59,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:57:59,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 12:57:59,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 12:57:59,667 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 12:57:59,667 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-28 12:57:59,667 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-28 12:57:59,667 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_first [2018-11-28 12:57:59,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:57:59,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 12:57:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 12:57:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 12:57:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 12:57:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 12:57:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 12:57:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 12:57:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 12:57:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 12:57:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 12:57:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 12:57:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 12:57:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 12:57:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 12:57:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 12:57:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 12:57:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 12:57:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 12:57:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 12:57:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 12:57:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 12:57:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 12:57:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 12:57:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 12:57:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 12:57:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 12:57:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 12:57:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 12:57:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 12:57:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 12:57:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 12:57:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 12:57:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 12:57:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 12:57:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 12:57:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 12:57:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 12:57:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 12:57:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 12:57:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 12:57:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 12:57:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 12:57:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 12:57:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 12:57:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 12:57:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 12:57:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 12:57:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 12:57:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 12:57:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 12:57:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 12:57:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 12:57:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 12:57:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 12:57:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 12:57:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 12:57:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 12:57:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 12:57:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 12:57:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 12:57:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 12:57:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 12:57:59,676 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 12:57:59,676 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 12:57:59,676 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 12:57:59,676 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 12:57:59,676 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 12:57:59,676 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 12:57:59,676 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 12:57:59,676 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 12:57:59,676 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 12:57:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 12:57:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 12:57:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 12:57:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 12:57:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 12:57:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 12:57:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 12:57:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 12:57:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 12:57:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 12:57:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 12:57:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 12:57:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 12:57:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 12:57:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 12:57:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 12:57:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 12:57:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 12:57:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 12:57:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 12:57:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 12:57:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 12:57:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 12:57:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 12:57:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 12:57:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 12:57:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 12:57:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 12:57:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 12:57:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 12:57:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 12:57:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 12:57:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 12:57:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 12:57:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 12:57:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 12:57:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-28 12:57:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:57:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 12:57:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:57:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-28 12:57:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_first [2018-11-28 12:57:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 12:57:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:57:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:57:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 12:57:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:57:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:57:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:57:59,998 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:57:59,998 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 12:57:59,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:57:59 BoogieIcfgContainer [2018-11-28 12:57:59,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:57:59,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:57:59,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:58:00,002 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:58:00,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:57:59" (1/3) ... [2018-11-28 12:58:00,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57aa9348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:58:00, skipping insertion in model container [2018-11-28 12:58:00,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:57:59" (2/3) ... [2018-11-28 12:58:00,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57aa9348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:58:00, skipping insertion in model container [2018-11-28 12:58:00,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:57:59" (3/3) ... [2018-11-28 12:58:00,005 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:58:00,012 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:58:00,018 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-11-28 12:58:00,033 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-11-28 12:58:00,056 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:58:00,057 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:58:00,057 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 12:58:00,057 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:58:00,057 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:58:00,057 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:58:00,057 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:58:00,057 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:58:00,058 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:58:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-11-28 12:58:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 12:58:00,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:00,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:58:00,078 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:00,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1174307177, now seen corresponding path program 1 times [2018-11-28 12:58:00,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:00,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:00,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:00,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:00,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:00,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:58:00,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:58:00,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:58:00,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:58:00,235 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2018-11-28 12:58:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:00,317 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-28 12:58:00,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:58:00,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 12:58:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:00,327 INFO L225 Difference]: With dead ends: 65 [2018-11-28 12:58:00,327 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 12:58:00,328 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-11-28 12:58:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 12:58:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-28 12:58:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 12:58:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-28 12:58:00,360 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 13 [2018-11-28 12:58:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:00,361 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-28 12:58:00,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:58:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-28 12:58:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 12:58:00,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:00,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:58:00,362 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:00,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:00,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1174307178, now seen corresponding path program 1 times [2018-11-28 12:58:00,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:00,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:00,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:00,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:00,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:00,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:58:00,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:58:00,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:58:00,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:58:00,431 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 3 states. [2018-11-28 12:58:00,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:00,454 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-28 12:58:00,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:58:00,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 12:58:00,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:00,456 INFO L225 Difference]: With dead ends: 56 [2018-11-28 12:58:00,456 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 12:58:00,457 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-11-28 12:58:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 12:58:00,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-28 12:58:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 12:58:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-28 12:58:00,462 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 13 [2018-11-28 12:58:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:00,463 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-28 12:58:00,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:58:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-28 12:58:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 12:58:00,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:00,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:58:00,464 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:00,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash -607396290, now seen corresponding path program 1 times [2018-11-28 12:58:00,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:00,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:00,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:00,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:58:00,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:58:00,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:58:00,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:58:00,509 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 4 states. [2018-11-28 12:58:00,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:00,534 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-28 12:58:00,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:58:00,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-28 12:58:00,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:00,537 INFO L225 Difference]: With dead ends: 59 [2018-11-28 12:58:00,537 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 12:58:00,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:58:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 12:58:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-28 12:58:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 12:58:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-28 12:58:00,548 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 15 [2018-11-28 12:58:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:00,548 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-28 12:58:00,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:58:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-28 12:58:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 12:58:00,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:00,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:58:00,549 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:00,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash 407818055, now seen corresponding path program 1 times [2018-11-28 12:58:00,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:00,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:00,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:00,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:00,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:00,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:58:00,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:58:00,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:58:00,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:58:00,576 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 5 states. [2018-11-28 12:58:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:00,629 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-28 12:58:00,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:58:00,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-28 12:58:00,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:00,630 INFO L225 Difference]: With dead ends: 68 [2018-11-28 12:58:00,630 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 12:58:00,631 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-11-28 12:58:00,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 12:58:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-11-28 12:58:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 12:58:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-28 12:58:00,636 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 17 [2018-11-28 12:58:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:00,636 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-28 12:58:00,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:58:00,636 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-28 12:58:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 12:58:00,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:00,637 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-11-28 12:58:00,638 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:00,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:00,638 INFO L82 PathProgramCache]: Analyzing trace with hash 395778245, now seen corresponding path program 1 times [2018-11-28 12:58:00,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:00,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:00,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:00,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:58:00,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:58:00,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:58:00,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:58:00,700 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 6 states. [2018-11-28 12:58:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:00,788 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-28 12:58:00,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:58:00,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 12:58:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:00,791 INFO L225 Difference]: With dead ends: 58 [2018-11-28 12:58:00,792 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 12:58:00,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:58:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 12:58:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-28 12:58:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 12:58:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-28 12:58:00,797 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 19 [2018-11-28 12:58:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:00,797 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-28 12:58:00,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:58:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-28 12:58:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 12:58:00,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:00,798 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-11-28 12:58:00,798 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:00,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash 395778246, now seen corresponding path program 1 times [2018-11-28 12:58:00,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:00,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:00,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:00,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:00,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:00,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:58:00,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:58:00,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:58:00,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:58:00,885 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 6 states. [2018-11-28 12:58:00,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:00,968 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-28 12:58:00,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:58:00,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 12:58:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:00,969 INFO L225 Difference]: With dead ends: 57 [2018-11-28 12:58:00,969 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 12:58:00,969 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-11-28 12:58:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 12:58:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-28 12:58:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 12:58:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-28 12:58:00,972 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 19 [2018-11-28 12:58:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:00,973 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-28 12:58:00,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:58:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-28 12:58:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:58:00,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:00,974 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] [2018-11-28 12:58:00,974 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:00,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1030344892, now seen corresponding path program 1 times [2018-11-28 12:58:00,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:00,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:00,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:00,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:01,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:58:01,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:58:01,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:01,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:01,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:58:01,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 12:58:01,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:58:01,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:58:01,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:58:01,130 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 6 states. [2018-11-28 12:58:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:01,183 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-28 12:58:01,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:58:01,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-28 12:58:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:01,184 INFO L225 Difference]: With dead ends: 70 [2018-11-28 12:58:01,184 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 12:58:01,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-11-28 12:58:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 12:58:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-11-28 12:58:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 12:58:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-28 12:58:01,189 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 30 [2018-11-28 12:58:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:01,189 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-28 12:58:01,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:58:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-28 12:58:01,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 12:58:01,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:01,191 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] [2018-11-28 12:58:01,191 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:01,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:01,191 INFO L82 PathProgramCache]: Analyzing trace with hash -911117721, now seen corresponding path program 2 times [2018-11-28 12:58:01,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:01,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:01,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:01,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:01,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:01,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:58:01,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:58:01,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:58:01,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:58:01,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:58:01,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:01,659 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-11-28 12:58:01,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:01,670 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-11-28 12:58:01,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:01,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:01,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 12:58:09,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:09,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:09,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-28 12:58:09,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:09,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-11-28 12:58:09,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:09,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:09,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:09,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:09,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:09,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 12:58:09,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:09,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:58:09,395 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-11-28 12:58:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 6 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:58:09,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:58:09,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2018-11-28 12:58:09,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 12:58:09,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 12:58:09,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=422, Unknown=6, NotChecked=0, Total=506 [2018-11-28 12:58:09,497 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 23 states. [2018-11-28 12:58:10,729 WARN L180 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 12:58:11,401 WARN L180 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 12:58:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:11,913 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-11-28 12:58:11,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 12:58:11,913 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-11-28 12:58:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:11,914 INFO L225 Difference]: With dead ends: 97 [2018-11-28 12:58:11,914 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 12:58:11,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=154, Invalid=831, Unknown=7, NotChecked=0, Total=992 [2018-11-28 12:58:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 12:58:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-11-28 12:58:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 12:58:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2018-11-28 12:58:11,918 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 43 [2018-11-28 12:58:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:11,918 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-11-28 12:58:11,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 12:58:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2018-11-28 12:58:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 12:58:11,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:11,919 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] [2018-11-28 12:58:11,919 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:11,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:11,919 INFO L82 PathProgramCache]: Analyzing trace with hash -911117722, now seen corresponding path program 1 times [2018-11-28 12:58:11,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:11,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:11,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:11,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:58:11,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:58:12,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:58:12,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:58:12,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:12,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:12,149 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-11-28 12:58:12,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:12,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:12,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 12:58:12,404 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (= (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) |c_#valid|)) is different from true [2018-11-28 12:58:14,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:14,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:14,446 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 20 treesize of output 27 [2018-11-28 12:58:14,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 20 [2018-11-28 12:58:14,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:14,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:14,458 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-11-28 12:58:14,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-11-28 12:58:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-11-28 12:58:14,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:58:14,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-28 12:58:14,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 12:58:14,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:58:14,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=194, Unknown=2, NotChecked=28, Total=272 [2018-11-28 12:58:14,530 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 17 states. [2018-11-28 12:58:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:48,682 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-11-28 12:58:48,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:58:48,682 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-11-28 12:58:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:48,683 INFO L225 Difference]: With dead ends: 99 [2018-11-28 12:58:48,683 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 12:58:48,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=4, NotChecked=38, Total=462 [2018-11-28 12:58:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 12:58:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-11-28 12:58:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 12:58:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2018-11-28 12:58:48,690 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 43 [2018-11-28 12:58:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:48,690 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2018-11-28 12:58:48,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 12:58:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2018-11-28 12:58:48,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 12:58:48,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:48,693 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-11-28 12:58:48,693 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:48,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1820121741, now seen corresponding path program 1 times [2018-11-28 12:58:48,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:48,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:48,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:48,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 12:58:48,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:48,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:58:48,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:58:48,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:58:48,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:58:48,818 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 13 states. [2018-11-28 12:58:49,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:49,142 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2018-11-28 12:58:49,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:58:49,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-28 12:58:49,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:49,144 INFO L225 Difference]: With dead ends: 108 [2018-11-28 12:58:49,144 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 12:58:49,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:58:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 12:58:49,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-11-28 12:58:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 12:58:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-11-28 12:58:49,151 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 44 [2018-11-28 12:58:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:49,152 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-11-28 12:58:49,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:58:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-11-28 12:58:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 12:58:49,153 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:49,153 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-11-28 12:58:49,153 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:49,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1820121742, now seen corresponding path program 1 times [2018-11-28 12:58:49,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:49,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:49,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:58:49,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:58:49,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:58:49,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:49,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:49,438 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-11-28 12:58:49,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:49,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:49,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:58:49,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 12:58:49,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 12:58:49,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:49,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:49,672 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 24 treesize of output 18 [2018-11-28 12:58:49,673 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 18 treesize of output 9 [2018-11-28 12:58:49,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:49,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:49,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:49,681 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:14 [2018-11-28 12:58:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:58:49,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 12:58:49,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 29 [2018-11-28 12:58:49,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-28 12:58:49,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-28 12:58:49,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2018-11-28 12:58:49,718 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 30 states. [2018-11-28 12:58:50,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:50,299 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2018-11-28 12:58:50,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:58:50,300 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-11-28 12:58:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:50,301 INFO L225 Difference]: With dead ends: 111 [2018-11-28 12:58:50,301 INFO L226 Difference]: Without dead ends: 111 [2018-11-28 12:58:50,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=1421, Unknown=0, NotChecked=0, Total=1560 [2018-11-28 12:58:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-28 12:58:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 94. [2018-11-28 12:58:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 12:58:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2018-11-28 12:58:50,307 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 44 [2018-11-28 12:58:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:50,307 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2018-11-28 12:58:50,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-28 12:58:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2018-11-28 12:58:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 12:58:50,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:50,308 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-11-28 12:58:50,308 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:50,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:50,309 INFO L82 PathProgramCache]: Analyzing trace with hash -715272213, now seen corresponding path program 1 times [2018-11-28 12:58:50,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:50,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:50,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:50,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:50,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:58:50,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:50,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:58:50,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:58:50,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:58:50,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:58:50,500 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand 13 states. [2018-11-28 12:58:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:50,824 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2018-11-28 12:58:50,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 12:58:50,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-11-28 12:58:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:50,825 INFO L225 Difference]: With dead ends: 110 [2018-11-28 12:58:50,825 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 12:58:50,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:58:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 12:58:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-11-28 12:58:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 12:58:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2018-11-28 12:58:50,831 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 47 [2018-11-28 12:58:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:50,832 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2018-11-28 12:58:50,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:58:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2018-11-28 12:58:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 12:58:50,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:50,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, 1, 1, 1, 1] [2018-11-28 12:58:50,833 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:50,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:50,833 INFO L82 PathProgramCache]: Analyzing trace with hash -698602002, now seen corresponding path program 1 times [2018-11-28 12:58:50,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:50,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:50,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 12:58:50,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:50,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:58:50,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:58:50,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:58:50,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:58:50,877 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand 5 states. [2018-11-28 12:58:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:51,007 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-11-28 12:58:51,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:58:51,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-28 12:58:51,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:51,009 INFO L225 Difference]: With dead ends: 99 [2018-11-28 12:58:51,009 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 12:58:51,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:58:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 12:58:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-28 12:58:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 12:58:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-11-28 12:58:51,016 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 48 [2018-11-28 12:58:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:51,017 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-11-28 12:58:51,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:58:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-11-28 12:58:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:58:51,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:51,018 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] [2018-11-28 12:58:51,018 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:51,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:51,018 INFO L82 PathProgramCache]: Analyzing trace with hash -181825458, now seen corresponding path program 1 times [2018-11-28 12:58:51,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:51,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:51,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:51,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:58:51,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:58:51,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:58:51,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:51,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:51,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:58:51,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:51,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:51,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:58:51,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:51,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:51,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:51,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 12:58:51,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:51,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:51,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2018-11-28 12:58:51,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 12:58:51,843 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 12 treesize of output 4 [2018-11-28 12:58:51,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:51,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:51,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:51,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-11-28 12:58:51,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:51,866 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-11-28 12:58:51,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:51,871 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-11-28 12:58:51,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 12:58:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:58:51,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:58:51,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 33 [2018-11-28 12:58:51,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-28 12:58:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-28 12:58:51,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 12:58:51,932 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 34 states. [2018-11-28 12:58:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:56,221 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-11-28 12:58:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 12:58:56,222 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 49 [2018-11-28 12:58:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:56,223 INFO L225 Difference]: With dead ends: 107 [2018-11-28 12:58:56,223 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 12:58:56,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=2032, Unknown=0, NotChecked=0, Total=2256 [2018-11-28 12:58:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 12:58:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-11-28 12:58:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 12:58:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-11-28 12:58:56,227 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 49 [2018-11-28 12:58:56,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:56,228 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-11-28 12:58:56,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-28 12:58:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-11-28 12:58:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 12:58:56,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:56,231 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:58:56,231 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:56,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:56,232 INFO L82 PathProgramCache]: Analyzing trace with hash 522283054, now seen corresponding path program 1 times [2018-11-28 12:58:56,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:56,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:56,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:56,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:56,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 12:58:56,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:58:56,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:58:56,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:58:56,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:58:56,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:58:56,279 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 5 states. [2018-11-28 12:58:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:56,326 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-11-28 12:58:56,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:58:56,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-28 12:58:56,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:56,327 INFO L225 Difference]: With dead ends: 103 [2018-11-28 12:58:56,327 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 12:58:56,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-28 12:58:56,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 12:58:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-28 12:58:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 12:58:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2018-11-28 12:58:56,330 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 54 [2018-11-28 12:58:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:56,331 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2018-11-28 12:58:56,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:58:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2018-11-28 12:58:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 12:58:56,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:56,332 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:58:56,332 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:56,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1401790500, now seen corresponding path program 3 times [2018-11-28 12:58:56,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:56,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:56,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:56,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:56,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 12:58:56,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:58:56,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:58:56,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:58:56,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 12:58:56,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:58:56,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 12:58:56,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:58:56,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 12:58:56,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:58:56,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:58:56,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:58:56,505 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 7 states. [2018-11-28 12:58:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:56,537 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-28 12:58:56,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:58:56,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-28 12:58:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:56,538 INFO L225 Difference]: With dead ends: 74 [2018-11-28 12:58:56,538 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 12:58:56,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 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-11-28 12:58:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 12:58:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-28 12:58:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 12:58:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-11-28 12:58:56,542 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 56 [2018-11-28 12:58:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:56,542 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-11-28 12:58:56,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:58:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-28 12:58:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 12:58:56,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:56,544 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] [2018-11-28 12:58:56,544 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:56,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:56,545 INFO L82 PathProgramCache]: Analyzing trace with hash -597157424, now seen corresponding path program 1 times [2018-11-28 12:58:56,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:56,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:56,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:56,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:58:56,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 12:58:56,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:58:56,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:58:56,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:56,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 12:58:56,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:58:56,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 12:58:56,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:58:56,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:58:56,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:58:56,669 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 5 states. [2018-11-28 12:58:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:56,692 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-11-28 12:58:56,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:58:56,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-11-28 12:58:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:56,693 INFO L225 Difference]: With dead ends: 67 [2018-11-28 12:58:56,694 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 12:58:56,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 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-11-28 12:58:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 12:58:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-28 12:58:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 12:58:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-11-28 12:58:56,696 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2018-11-28 12:58:56,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:56,696 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-11-28 12:58:56,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:58:56,696 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-11-28 12:58:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:58:56,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:56,697 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:58:56,697 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:56,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:56,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1328936515, now seen corresponding path program 1 times [2018-11-28 12:58:56,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:56,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:56,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:56,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:57,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:58:57,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:58:57,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:58:57,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:58:57,220 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-11-28 12:58:57,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:57,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:57,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 12:58:57,305 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:57,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:57,307 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-11-28 12:58:57,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:57,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:57,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-11-28 12:58:57,379 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-11-28 12:58:57,381 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-11-28 12:58:57,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:57,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:57,390 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-11-28 12:58:57,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-11-28 12:58:57,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 12:58:57,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-28 12:58:57,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:57,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:57,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:57,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2018-11-28 12:58:57,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:57,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:57,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 72 [2018-11-28 12:58:57,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2018-11-28 12:58:57,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:58:57,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:58:57,953 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:58:57,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 54 [2018-11-28 12:58:57,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:57,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 12:58:57,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 12:58:57,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:173 [2018-11-28 12:58:58,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2018-11-28 12:58:58,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-28 12:58:58,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:58,194 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:58:58,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-28 12:58:58,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:58,204 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:58:58,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-28 12:58:58,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:58:58,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:58:58,216 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-11-28 12:58:58,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:18 [2018-11-28 12:58:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:58:58,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:58:58,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 49 [2018-11-28 12:58:58,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-28 12:58:58,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-28 12:58:58,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2300, Unknown=0, NotChecked=0, Total=2450 [2018-11-28 12:58:58,308 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 50 states. [2018-11-28 12:58:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:58:59,674 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-28 12:58:59,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-28 12:58:59,674 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2018-11-28 12:58:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:58:59,676 INFO L225 Difference]: With dead ends: 77 [2018-11-28 12:58:59,676 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 12:58:59,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2018-11-28 12:58:59,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 12:58:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2018-11-28 12:58:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-28 12:58:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-11-28 12:58:59,681 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 57 [2018-11-28 12:58:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:58:59,681 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-11-28 12:58:59,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-28 12:58:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-11-28 12:58:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:58:59,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:58:59,685 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:58:59,686 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:58:59,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:58:59,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1328936514, now seen corresponding path program 1 times [2018-11-28 12:58:59,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:58:59,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:58:59,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:59,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:58:59,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:58:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:59:00,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:59:00,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:59:00,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:00,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:59:00,435 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-11-28 12:59:00,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:00,440 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-11-28 12:59:00,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:00,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:00,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 12:59:00,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:00,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:00,740 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-11-28 12:59:00,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:00,751 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-11-28 12:59:00,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:00,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:00,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-28 12:59:00,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:59:00,839 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-11-28 12:59:00,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:00,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:00,852 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-11-28 12:59:00,854 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-11-28 12:59:00,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:00,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:00,865 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-11-28 12:59:00,865 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:53 [2018-11-28 12:59:01,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2018-11-28 12:59:01,125 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 57 treesize of output 49 [2018-11-28 12:59:01,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:01,142 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 49 treesize of output 39 [2018-11-28 12:59:01,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:01,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-11-28 12:59:01,157 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:01,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-28 12:59:01,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-28 12:59:01,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-28 12:59:01,193 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:01,197 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:01,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 35 [2018-11-28 12:59:01,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-28 12:59:01,202 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:01,207 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:01,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-28 12:59:01,220 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:83, output treesize:43 [2018-11-28 12:59:03,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:03,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 123 [2018-11-28 12:59:03,808 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:59:03,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2018-11-28 12:59:03,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:03,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 84 [2018-11-28 12:59:03,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:03,958 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:04,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 12:59:04,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 102 [2018-11-28 12:59:04,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 90 [2018-11-28 12:59:04,141 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,194 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:59:04,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:04,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 102 [2018-11-28 12:59:04,198 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:04,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 133 [2018-11-28 12:59:04,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-28 12:59:04,229 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,250 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,254 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 98 treesize of output 85 [2018-11-28 12:59:04,257 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:59:04,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:04,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2018-11-28 12:59:04,263 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,278 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2018-11-28 12:59:04,344 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:161, output treesize:343 [2018-11-28 12:59:04,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 40 [2018-11-28 12:59:04,771 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:59:04,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:04,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-11-28 12:59:04,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-11-28 12:59:04,804 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:59:04,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-11-28 12:59:04,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-28 12:59:04,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,836 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:59:04,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:04,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-28 12:59:04,837 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:04,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:04,852 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:103, output treesize:28 [2018-11-28 12:59:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:59:04,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:59:04,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2018-11-28 12:59:04,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-28 12:59:04,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-28 12:59:04,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=3261, Unknown=1, NotChecked=0, Total=3422 [2018-11-28 12:59:04,940 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 59 states. [2018-11-28 12:59:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:59:30,892 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-11-28 12:59:30,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-28 12:59:30,893 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 57 [2018-11-28 12:59:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:59:30,893 INFO L225 Difference]: With dead ends: 80 [2018-11-28 12:59:30,893 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 12:59:30,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=692, Invalid=9398, Unknown=10, NotChecked=0, Total=10100 [2018-11-28 12:59:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 12:59:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-28 12:59:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 12:59:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-11-28 12:59:30,897 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 57 [2018-11-28 12:59:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:59:30,897 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-28 12:59:30,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-28 12:59:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-28 12:59:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 12:59:30,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:59:30,898 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, 1, 1] [2018-11-28 12:59:30,898 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:59:30,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash 660869819, now seen corresponding path program 1 times [2018-11-28 12:59:30,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:30,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:30,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 12:59:31,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:59:31,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:59:31,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:31,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:59:31,329 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-11-28 12:59:31,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:31,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:31,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:59:31,457 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-11-28 12:59:31,458 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-11-28 12:59:31,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:31,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:31,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:31,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 12:59:31,654 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 13 treesize of output 7 [2018-11-28 12:59:31,655 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-11-28 12:59:31,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:31,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:31,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-28 12:59:31,666 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 7 treesize of output 5 [2018-11-28 12:59:31,666 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:31,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:31,674 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-11-28 12:59:31,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:12 [2018-11-28 12:59:33,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 3 [2018-11-28 12:59:33,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:33,054 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:59:33,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 48 [2018-11-28 12:59:33,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-11-28 12:59:33,063 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:33,068 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:33,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-11-28 12:59:33,079 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 38 treesize of output 32 [2018-11-28 12:59:33,079 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:33,084 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:33,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:33,091 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:83, output treesize:38 [2018-11-28 12:59:33,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2018-11-28 12:59:33,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:33,263 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 29 treesize of output 13 [2018-11-28 12:59:33,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:33,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:33,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:33,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:7 [2018-11-28 12:59:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:59:33,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:59:33,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30] total 48 [2018-11-28 12:59:33,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-28 12:59:33,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-28 12:59:33,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2218, Unknown=1, NotChecked=0, Total=2352 [2018-11-28 12:59:33,315 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 49 states. [2018-11-28 12:59:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:59:38,424 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-11-28 12:59:38,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-28 12:59:38,424 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 60 [2018-11-28 12:59:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:59:38,425 INFO L225 Difference]: With dead ends: 80 [2018-11-28 12:59:38,425 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 12:59:38,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=389, Invalid=5158, Unknown=3, NotChecked=0, Total=5550 [2018-11-28 12:59:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 12:59:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-28 12:59:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 12:59:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-11-28 12:59:38,429 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 60 [2018-11-28 12:59:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:59:38,430 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-11-28 12:59:38,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-28 12:59:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-28 12:59:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 12:59:38,430 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:59:38,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:59:38,431 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 12:59:38,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:59:38,431 INFO L82 PathProgramCache]: Analyzing trace with hash -559259874, now seen corresponding path program 1 times [2018-11-28 12:59:38,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:59:38,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:59:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:38,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:59:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:59:38,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:59:38,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 12:59:38,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:59:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:59:38,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:59:38,941 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-11-28 12:59:38,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:38,946 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-11-28 12:59:38,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:38,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:38,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 12:59:42,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:42,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:42,964 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-11-28 12:59:42,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:42,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:42,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-28 12:59:42,996 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 2 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 12:59:42,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:59:43,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:59:43,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:59:43,018 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:28, output treesize:45 [2018-11-28 12:59:43,098 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 29 treesize of output 25 [2018-11-28 12:59:43,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 12:59:43,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,112 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 16 [2018-11-28 12:59:43,113 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 7 treesize of output 5 [2018-11-28 12:59:43,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:43,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:43,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-28 12:59:43,125 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-11-28 12:59:43,282 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 25 treesize of output 24 [2018-11-28 12:59:43,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,293 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 21 treesize of output 20 [2018-11-28 12:59:43,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-28 12:59:43,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:45 [2018-11-28 12:59:43,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-28 12:59:43,364 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 11 [2018-11-28 12:59:43,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:43,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:43,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-11-28 12:59:43,410 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 20 treesize of output 11 [2018-11-28 12:59:43,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,445 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 34 treesize of output 30 [2018-11-28 12:59:43,447 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 11 [2018-11-28 12:59:43,447 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:43,452 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:59:43,481 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 49 treesize of output 43 [2018-11-28 12:59:43,483 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 20 treesize of output 11 [2018-11-28 12:59:43,483 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,490 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-11-28 12:59:43,518 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:167, output treesize:121 [2018-11-28 12:59:43,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:43,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:43,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:43,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 34 [2018-11-28 12:59:43,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-28 12:59:43,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:59:43,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:58 [2018-11-28 12:59:43,827 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 43 treesize of output 39 [2018-11-28 12:59:43,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 12:59:43,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,848 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 36 [2018-11-28 12:59:43,849 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 19 treesize of output 10 [2018-11-28 12:59:43,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,868 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 28 [2018-11-28 12:59:43,870 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 13 treesize of output 9 [2018-11-28 12:59:43,870 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,874 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,886 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 27 treesize of output 25 [2018-11-28 12:59:43,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-28 12:59:43,887 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,891 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:59:43,901 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:86, output treesize:42 [2018-11-28 12:59:43,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:43,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:43,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:59:43,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-28 12:59:43,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:59:43,985 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-11-28 12:59:43,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-11-28 12:59:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:59:44,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:59:44,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-11-28 12:59:44,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-28 12:59:44,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-28 12:59:44,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2178, Unknown=10, NotChecked=0, Total=2352 [2018-11-28 12:59:44,048 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 49 states. [2018-11-28 13:00:16,110 WARN L180 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 13:00:23,991 WARN L180 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 13:00:37,013 WARN L180 SmtUtils]: Spent 1.74 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 13:00:50,652 WARN L180 SmtUtils]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 13:00:59,021 WARN L180 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 13:00:59,661 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-28 13:02:22,688 WARN L180 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 40 [2018-11-28 13:02:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:55,336 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-11-28 13:02:55,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-28 13:02:55,336 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 62 [2018-11-28 13:02:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:55,337 INFO L225 Difference]: With dead ends: 77 [2018-11-28 13:02:55,337 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 13:02:55,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 132.5s TimeCoverageRelationStatistics Valid=693, Invalid=5004, Unknown=155, NotChecked=0, Total=5852 [2018-11-28 13:02:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 13:02:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-28 13:02:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 13:02:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-11-28 13:02:55,341 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2018-11-28 13:02:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:55,341 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-11-28 13:02:55,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-28 13:02:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-11-28 13:02:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 13:02:55,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:55,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:02:55,342 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 13:02:55,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash -604503808, now seen corresponding path program 2 times [2018-11-28 13:02:55,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:55,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:55,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:55,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:55,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:02:56,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:02:56,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/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-11-28 13:02:56,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:02:56,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:02:56,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:02:56,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:02:56,476 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-11-28 13:02:56,477 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-11-28 13:02:56,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:56,485 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-11-28 13:02:56,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:47 [2018-11-28 13:02:58,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 13:02:58,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-28 13:02:58,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:58,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:58,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:58,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2018-11-28 13:02:58,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,390 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 105 treesize of output 99 [2018-11-28 13:02:58,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 81 [2018-11-28 13:02:58,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:58,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:58,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:58,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:83 [2018-11-28 13:02:58,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:58,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,572 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 92 treesize of output 80 [2018-11-28 13:02:58,574 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 49 treesize of output 42 [2018-11-28 13:02:58,574 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:58,583 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:58,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-11-28 13:02:58,584 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:58,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:58,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:58,602 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:59 [2018-11-28 13:02:58,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:02:58,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2018-11-28 13:02:58,753 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:02:58,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-28 13:02:58,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:02:58,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:02:58,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:02:58,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2018-11-28 13:02:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:02:58,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:02:58,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 57 [2018-11-28 13:02:58,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-28 13:02:58,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-28 13:02:58,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3120, Unknown=2, NotChecked=0, Total=3306 [2018-11-28 13:02:58,852 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 58 states. [2018-11-28 13:03:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:01,739 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-28 13:03:01,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 13:03:01,739 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 69 [2018-11-28 13:03:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:01,740 INFO L225 Difference]: With dead ends: 83 [2018-11-28 13:03:01,740 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 13:03:01,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=259, Invalid=4161, Unknown=2, NotChecked=0, Total=4422 [2018-11-28 13:03:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 13:03:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-11-28 13:03:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 13:03:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-11-28 13:03:01,743 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2018-11-28 13:03:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:01,744 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-11-28 13:03:01,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-28 13:03:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-11-28 13:03:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 13:03:01,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:01,744 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:01,744 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-11-28 13:03:01,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:01,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1556674419, now seen corresponding path program 2 times [2018-11-28 13:03:01,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:01,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:01,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 13:03:01,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:01,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:03:01,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:03:01,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:03:01,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:03:01,777 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 6 states. [2018-11-28 13:03:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:01,803 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-28 13:03:01,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:03:01,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-28 13:03:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:01,803 INFO L225 Difference]: With dead ends: 59 [2018-11-28 13:03:01,803 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:03:01,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:03:01,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:03:01,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:03:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:03:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:03:01,804 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-11-28 13:03:01,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:01,804 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:03:01,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:03:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:03:01,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:03:01,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:03:01 BoogieIcfgContainer [2018-11-28 13:03:01,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:03:01,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:03:01,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:03:01,811 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:03:01,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:57:59" (3/4) ... [2018-11-28 13:03:01,815 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:03:01,821 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:03:01,821 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 13:03:01,821 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 13:03:01,822 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 13:03:01,822 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-11-28 13:03:01,822 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:03:01,822 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_remove_first [2018-11-28 13:03:01,822 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-28 13:03:01,826 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-28 13:03:01,827 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-28 13:03:01,827 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 13:03:01,867 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_89af2569-36fb-4e59-8c29-d78c05bd3a17/bin-2019/uautomizer/witness.graphml [2018-11-28 13:03:01,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:03:01,869 INFO L168 Benchmark]: Toolchain (without parser) took 302642.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 243.3 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -108.8 MB). Peak memory consumption was 134.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:01,870 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:03:01,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:01,870 INFO L168 Benchmark]: Boogie Preprocessor took 41.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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:01,870 INFO L168 Benchmark]: RCFGBuilder took 372.42 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: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:01,870 INFO L168 Benchmark]: TraceAbstraction took 301809.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.5 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:01,871 INFO L168 Benchmark]: Witness Printer took 57.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.2 kB). Peak memory consumption was 62.2 kB. Max. memory is 11.5 GB. [2018-11-28 13:03:01,872 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 372.42 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: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 301809.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.5 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. * Witness Printer took 57.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.2 kB). Peak memory consumption was 62.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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 9 procedures, 75 locations, 19 error locations. SAFE Result, 301.7s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 269.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 964 SDtfs, 1183 SDslu, 6350 SDs, 0 SdLazy, 11238 SolverSat, 336 SolverUnsat, 145 SolverUnknown, 0 SolverNotchecked, 117.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1118 GetRequests, 498 SyntacticMatches, 21 SemanticMatches, 599 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7378 ImplicationChecksByTransitivity, 178.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 93 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 1611 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1576 ConstructedInterpolants, 203 QuantifiedInterpolants, 1046327 SizeOfPredicates, 163 NumberOfNonLiveVariables, 3318 ConjunctsInSsa, 611 ConjunctsInUnsatCore, 35 InterpolantComputations, 12 PerfectInterpolantSequences, 289/573 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...