./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/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_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/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-635dfa2 [2018-12-02 21:54:29,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:54:29,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:54:29,199 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:54:29,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:54:29,199 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:54:29,200 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:54:29,201 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:54:29,202 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:54:29,203 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:54:29,204 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:54:29,204 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:54:29,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:54:29,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:54:29,206 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:54:29,207 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:54:29,207 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:54:29,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:54:29,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:54:29,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:54:29,212 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:54:29,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:54:29,214 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:54:29,214 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:54:29,214 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:54:29,215 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:54:29,216 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:54:29,216 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:54:29,217 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:54:29,218 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:54:29,218 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:54:29,218 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:54:29,218 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:54:29,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:54:29,219 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:54:29,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:54:29,220 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 21:54:29,229 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:54:29,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:54:29,230 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:54:29,230 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:54:29,230 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:54:29,231 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:54:29,231 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 21:54:29,231 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:54:29,231 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:54:29,231 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:54:29,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:54:29,231 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:54:29,231 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:54:29,232 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 21:54:29,232 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 21:54:29,232 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 21:54:29,232 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:54:29,232 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:54:29,232 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:54:29,232 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:54:29,232 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:54:29,232 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:54:29,233 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:54:29,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:54:29,233 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:54:29,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:54:29,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 21:54:29,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:54:29,233 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_04f0f3cd-f9f7-4468-a51d-748044716378/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-12-02 21:54:29,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:54:29,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:54:29,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:54:29,268 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:54:29,268 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:54:29,269 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:54:29,314 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/data/a24d03136/5e0de63122084effa7f2241e397f54ec/FLAG4bfb4979d [2018-12-02 21:54:29,681 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:54:29,682 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:54:29,688 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/data/a24d03136/5e0de63122084effa7f2241e397f54ec/FLAG4bfb4979d [2018-12-02 21:54:29,695 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/data/a24d03136/5e0de63122084effa7f2241e397f54ec [2018-12-02 21:54:29,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:54:29,698 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 21:54:29,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:54:29,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:54:29,701 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:54:29,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:54:29" (1/1) ... [2018-12-02 21:54:29,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b7dfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:54:29, skipping insertion in model container [2018-12-02 21:54:29,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:54:29" (1/1) ... [2018-12-02 21:54:29,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:54:29,735 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:54:29,896 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:54:29,937 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:54:29,964 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:54:29,993 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:54:29,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:54:29 WrapperNode [2018-12-02 21:54:29,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:54:29,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:54:29,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:54:29,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:54:30,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:54:29" (1/1) ... [2018-12-02 21:54:30,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:54:29" (1/1) ... [2018-12-02 21:54:30,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:54:29" (1/1) ... [2018-12-02 21:54:30,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:54:29" (1/1) ... [2018-12-02 21:54:30,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:54:29" (1/1) ... [2018-12-02 21:54:30,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:54:29" (1/1) ... [2018-12-02 21:54:30,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:54:29" (1/1) ... [2018-12-02 21:54:30,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:54:30,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:54:30,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:54:30,026 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:54:30,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:54:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:54:30,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:54:30,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:54:30,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 21:54:30,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 21:54:30,059 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 21:54:30,059 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 21:54:30,059 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-02 21:54:30,059 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_first [2018-12-02 21:54:30,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:54:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 21:54:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 21:54:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 21:54:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 21:54:30,059 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 21:54:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 21:54:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 21:54:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 21:54:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 21:54:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 21:54:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 21:54:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-02 21:54:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_first [2018-12-02 21:54:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 21:54:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:54:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:54:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 21:54:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:54:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:54:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 21:54:30,310 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:54:30,310 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 21:54:30,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:54:30 BoogieIcfgContainer [2018-12-02 21:54:30,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:54:30,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:54:30,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:54:30,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:54:30,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:54:29" (1/3) ... [2018-12-02 21:54:30,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111b0e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:54:30, skipping insertion in model container [2018-12-02 21:54:30,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:54:29" (2/3) ... [2018-12-02 21:54:30,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111b0e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:54:30, skipping insertion in model container [2018-12-02 21:54:30,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:54:30" (3/3) ... [2018-12-02 21:54:30,316 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:54:30,323 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:54:30,328 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-12-02 21:54:30,338 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-12-02 21:54:30,355 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:54:30,356 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:54:30,356 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 21:54:30,356 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:54:30,356 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:54:30,356 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:54:30,356 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:54:30,356 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:54:30,356 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:54:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-12-02 21:54:30,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 21:54:30,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:54:30,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:54:30,375 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:54:30,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:54:30,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1174307177, now seen corresponding path program 1 times [2018-12-02 21:54:30,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:54:30,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:54:30,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:54:30,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:30,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:54:30,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:54:30,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:54:30,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:54:30,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:54:30,507 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2018-12-02 21:54:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:54:30,564 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-12-02 21:54:30,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:54:30,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 21:54:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:54:30,571 INFO L225 Difference]: With dead ends: 65 [2018-12-02 21:54:30,571 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 21:54:30,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:54:30,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 21:54:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-02 21:54:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 21:54:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-02 21:54:30,595 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 13 [2018-12-02 21:54:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:54:30,595 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-02 21:54:30,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:54:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-02 21:54:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 21:54:30,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:54:30,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:54:30,596 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:54:30,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:54:30,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1174307178, now seen corresponding path program 1 times [2018-12-02 21:54:30,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:54:30,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:54:30,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:54:30,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:30,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:54:30,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:54:30,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:54:30,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:54:30,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:54:30,640 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 3 states. [2018-12-02 21:54:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:54:30,663 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-12-02 21:54:30,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:54:30,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 21:54:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:54:30,664 INFO L225 Difference]: With dead ends: 56 [2018-12-02 21:54:30,664 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 21:54:30,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:54:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 21:54:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-02 21:54:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 21:54:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-12-02 21:54:30,667 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 13 [2018-12-02 21:54:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:54:30,667 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-12-02 21:54:30,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:54:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-12-02 21:54:30,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 21:54:30,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:54:30,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:54:30,668 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:54:30,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:54:30,668 INFO L82 PathProgramCache]: Analyzing trace with hash -607396290, now seen corresponding path program 1 times [2018-12-02 21:54:30,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:54:30,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:54:30,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:54:30,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:30,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:54:30,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:54:30,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:54:30,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:54:30,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:54:30,701 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 4 states. [2018-12-02 21:54:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:54:30,718 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-12-02 21:54:30,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:54:30,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-02 21:54:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:54:30,720 INFO L225 Difference]: With dead ends: 59 [2018-12-02 21:54:30,720 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 21:54:30,721 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-12-02 21:54:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 21:54:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-12-02 21:54:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 21:54:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-02 21:54:30,728 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 15 [2018-12-02 21:54:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:54:30,728 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-02 21:54:30,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:54:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-02 21:54:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 21:54:30,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:54:30,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:54:30,729 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:54:30,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:54:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash 407818055, now seen corresponding path program 1 times [2018-12-02 21:54:30,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:54:30,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:54:30,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:54:30,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:30,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:54:30,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:54:30,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:54:30,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:54:30,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:54:30,758 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 5 states. [2018-12-02 21:54:30,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:54:30,783 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-02 21:54:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:54:30,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 21:54:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:54:30,784 INFO L225 Difference]: With dead ends: 68 [2018-12-02 21:54:30,784 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 21:54:30,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:54:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 21:54:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-12-02 21:54:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 21:54:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-02 21:54:30,787 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 17 [2018-12-02 21:54:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:54:30,787 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-02 21:54:30,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:54:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-02 21:54:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 21:54:30,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:54:30,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:54:30,788 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:54:30,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:54:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash 395778245, now seen corresponding path program 1 times [2018-12-02 21:54:30,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:54:30,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:54:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:54:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:30,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:54:30,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:54:30,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:54:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:54:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:54:30,828 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 6 states. [2018-12-02 21:54:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:54:30,905 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-12-02 21:54:30,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:54:30,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 21:54:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:54:30,907 INFO L225 Difference]: With dead ends: 58 [2018-12-02 21:54:30,907 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 21:54:30,908 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-12-02 21:54:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 21:54:30,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-02 21:54:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 21:54:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-02 21:54:30,911 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 19 [2018-12-02 21:54:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:54:30,911 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-02 21:54:30,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:54:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-02 21:54:30,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 21:54:30,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:54:30,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:54:30,912 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:54:30,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:54:30,912 INFO L82 PathProgramCache]: Analyzing trace with hash 395778246, now seen corresponding path program 1 times [2018-12-02 21:54:30,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:54:30,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:54:30,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:54:30,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:30,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:54:30,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:54:30,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:54:30,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:54:30,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:54:30,964 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 6 states. [2018-12-02 21:54:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:54:31,029 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-02 21:54:31,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:54:31,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 21:54:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:54:31,030 INFO L225 Difference]: With dead ends: 57 [2018-12-02 21:54:31,030 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 21:54:31,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:54:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 21:54:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-02 21:54:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 21:54:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-12-02 21:54:31,033 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 19 [2018-12-02 21:54:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:54:31,033 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-12-02 21:54:31,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:54:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-12-02 21:54:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 21:54:31,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:54:31,033 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-12-02 21:54:31,034 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:54:31,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:54:31,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1030344892, now seen corresponding path program 1 times [2018-12-02 21:54:31,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:54:31,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:54:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:31,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:54:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:31,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:54:31,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:54:31,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:54:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:31,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:54:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:31,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:54:31,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 21:54:31,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:54:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:54:31,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:54:31,142 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 6 states. [2018-12-02 21:54:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:54:31,168 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-02 21:54:31,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:54:31,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-02 21:54:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:54:31,169 INFO L225 Difference]: With dead ends: 70 [2018-12-02 21:54:31,169 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 21:54:31,169 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-12-02 21:54:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 21:54:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-12-02 21:54:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 21:54:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-02 21:54:31,172 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 30 [2018-12-02 21:54:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:54:31,173 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-02 21:54:31,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:54:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-02 21:54:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 21:54:31,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:54:31,174 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:54:31,174 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:54:31,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:54:31,174 INFO L82 PathProgramCache]: Analyzing trace with hash -911117721, now seen corresponding path program 2 times [2018-12-02 21:54:31,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:54:31,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:54:31,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:31,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:54:31,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:31,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:54:31,519 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:54:31,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 21:54:31,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 21:54:31,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:54:31,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:54:31,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:54:31,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:54:31,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:54:31,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:54:31,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:54:31,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 21:54:38,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:54:38,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:54:38,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-02 21:54:38,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:54:38,640 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-12-02 21:54:38,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:54:38,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:54:38,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:54:38,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:54:38,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:54:38,661 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-12-02 21:54:38,662 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:54:38,680 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-12-02 21:54:38,681 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-12-02 21:54:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 6 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:54:38,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:54:38,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2018-12-02 21:54:38,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 21:54:38,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 21:54:38,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=422, Unknown=6, NotChecked=0, Total=506 [2018-12-02 21:54:38,778 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 23 states. [2018-12-02 21:54:39,994 WARN L180 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 21:54:40,564 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-02 21:54:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:54:41,043 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-12-02 21:54:41,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 21:54:41,044 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-12-02 21:54:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:54:41,044 INFO L225 Difference]: With dead ends: 97 [2018-12-02 21:54:41,044 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 21:54:41,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=154, Invalid=831, Unknown=7, NotChecked=0, Total=992 [2018-12-02 21:54:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 21:54:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-12-02 21:54:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 21:54:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2018-12-02 21:54:41,048 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 43 [2018-12-02 21:54:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:54:41,049 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-12-02 21:54:41,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 21:54:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2018-12-02 21:54:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 21:54:41,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:54:41,049 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-12-02 21:54:41,050 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:54:41,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:54:41,050 INFO L82 PathProgramCache]: Analyzing trace with hash -911117722, now seen corresponding path program 1 times [2018-12-02 21:54:41,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:54:41,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:54:41,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:41,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:54:41,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:54:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:54:41,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:54:41,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:54:41,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:54:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:41,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:54:41,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:54:41,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:54:41,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:54:41,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:54:41,449 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-12-02 21:54:43,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:54:43,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:54:43,475 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-12-02 21:54:43,477 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-12-02 21:54:43,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:54:43,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:54:43,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:54:43,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-12-02 21:54:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-02 21:54:43,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:54:43,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-12-02 21:54:43,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:54:43,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:54:43,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=194, Unknown=2, NotChecked=28, Total=272 [2018-12-02 21:54:43,547 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 17 states. [2018-12-02 21:55:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:55:15,818 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-12-02 21:55:15,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:55:15,818 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-12-02 21:55:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:55:15,819 INFO L225 Difference]: With dead ends: 99 [2018-12-02 21:55:15,819 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 21:55:15,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=4, NotChecked=38, Total=462 [2018-12-02 21:55:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 21:55:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-12-02 21:55:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 21:55:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2018-12-02 21:55:15,825 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 43 [2018-12-02 21:55:15,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:55:15,825 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2018-12-02 21:55:15,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:55:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2018-12-02 21:55:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 21:55:15,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:55:15,826 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:55:15,826 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:55:15,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:55:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1820121741, now seen corresponding path program 1 times [2018-12-02 21:55:15,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:55:15,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:55:15,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:15,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:15,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 21:55:15,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:55:15,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 21:55:15,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:55:15,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:55:15,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:55:15,915 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 13 states. [2018-12-02 21:55:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:55:16,125 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2018-12-02 21:55:16,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:55:16,125 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-12-02 21:55:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:55:16,126 INFO L225 Difference]: With dead ends: 108 [2018-12-02 21:55:16,126 INFO L226 Difference]: Without dead ends: 108 [2018-12-02 21:55:16,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:55:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-02 21:55:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-12-02 21:55:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 21:55:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-12-02 21:55:16,131 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 44 [2018-12-02 21:55:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:55:16,131 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-12-02 21:55:16,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:55:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-12-02 21:55:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 21:55:16,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:55:16,132 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:55:16,132 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:55:16,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:55:16,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1820121742, now seen corresponding path program 1 times [2018-12-02 21:55:16,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:55:16,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:55:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:16,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:55:16,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:55:16,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:55:16,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:16,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:55:16,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:55:16,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:16,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:16,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:55:16,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 21:55:16,557 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-12-02 21:55:16,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:16,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:16,565 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-12-02 21:55:16,566 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-12-02 21:55:16,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:16,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:16,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:16,573 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:14 [2018-12-02 21:55:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:55:16,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:55:16,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 29 [2018-12-02 21:55:16,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 21:55:16,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 21:55:16,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2018-12-02 21:55:16,609 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 30 states. [2018-12-02 21:55:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:55:17,116 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2018-12-02 21:55:17,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:55:17,117 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-12-02 21:55:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:55:17,117 INFO L225 Difference]: With dead ends: 111 [2018-12-02 21:55:17,117 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 21:55:17,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=1421, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 21:55:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 21:55:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 94. [2018-12-02 21:55:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 21:55:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2018-12-02 21:55:17,121 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 44 [2018-12-02 21:55:17,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:55:17,121 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2018-12-02 21:55:17,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 21:55:17,121 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2018-12-02 21:55:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 21:55:17,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:55:17,122 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:55:17,122 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:55:17,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:55:17,122 INFO L82 PathProgramCache]: Analyzing trace with hash -715272213, now seen corresponding path program 1 times [2018-12-02 21:55:17,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:55:17,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:55:17,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:17,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:17,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:55:17,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:55:17,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 21:55:17,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 21:55:17,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 21:55:17,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:55:17,198 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand 13 states. [2018-12-02 21:55:17,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:55:17,363 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2018-12-02 21:55:17,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:55:17,364 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-12-02 21:55:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:55:17,365 INFO L225 Difference]: With dead ends: 110 [2018-12-02 21:55:17,365 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 21:55:17,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:55:17,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 21:55:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-12-02 21:55:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 21:55:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2018-12-02 21:55:17,369 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 47 [2018-12-02 21:55:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:55:17,370 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2018-12-02 21:55:17,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 21:55:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2018-12-02 21:55:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 21:55:17,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:55:17,370 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-12-02 21:55:17,371 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:55:17,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:55:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash -698602002, now seen corresponding path program 1 times [2018-12-02 21:55:17,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:55:17,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:55:17,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:17,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:17,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:55:17,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:55:17,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:55:17,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:55:17,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:55:17,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:55:17,400 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand 5 states. [2018-12-02 21:55:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:55:17,438 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-12-02 21:55:17,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:55:17,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-02 21:55:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:55:17,439 INFO L225 Difference]: With dead ends: 99 [2018-12-02 21:55:17,439 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 21:55:17,439 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-12-02 21:55:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 21:55:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-02 21:55:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 21:55:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-12-02 21:55:17,442 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 48 [2018-12-02 21:55:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:55:17,442 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-12-02 21:55:17,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:55:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-12-02 21:55:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 21:55:17,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:55:17,443 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-12-02 21:55:17,443 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:55:17,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:55:17,443 INFO L82 PathProgramCache]: Analyzing trace with hash -181825458, now seen corresponding path program 1 times [2018-12-02 21:55:17,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:55:17,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:55:17,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:17,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:17,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:55:17,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:55:17,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:55:17,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:17,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:55:17,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:55:17,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:17,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:17,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:55:17,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:17,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:17,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:17,890 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-12-02 21:55:17,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:17,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:17,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2018-12-02 21:55:17,996 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-12-02 21:55:17,997 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-12-02 21:55:17,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:17,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:18,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:18,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-02 21:55:18,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:18,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-02 21:55:18,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:18,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:18,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 21:55:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:55:18,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:55:18,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 33 [2018-12-02 21:55:18,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-02 21:55:18,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-02 21:55:18,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 21:55:18,086 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 34 states. [2018-12-02 21:55:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:55:20,663 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-12-02 21:55:20,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 21:55:20,663 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 49 [2018-12-02 21:55:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:55:20,664 INFO L225 Difference]: With dead ends: 107 [2018-12-02 21:55:20,664 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 21:55:20,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=2032, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 21:55:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 21:55:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-12-02 21:55:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 21:55:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-12-02 21:55:20,667 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 49 [2018-12-02 21:55:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:55:20,668 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-12-02 21:55:20,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-02 21:55:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-12-02 21:55:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 21:55:20,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:55:20,669 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:55:20,669 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:55:20,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:55:20,669 INFO L82 PathProgramCache]: Analyzing trace with hash 522283054, now seen corresponding path program 1 times [2018-12-02 21:55:20,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:55:20,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:55:20,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:20,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:20,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:55:20,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:55:20,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:55:20,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:55:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:55:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:55:20,695 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 5 states. [2018-12-02 21:55:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:55:20,740 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-12-02 21:55:20,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:55:20,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 21:55:20,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:55:20,741 INFO L225 Difference]: With dead ends: 103 [2018-12-02 21:55:20,741 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 21:55:20,741 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-12-02 21:55:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 21:55:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-02 21:55:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 21:55:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2018-12-02 21:55:20,744 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 54 [2018-12-02 21:55:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:55:20,745 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2018-12-02 21:55:20,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:55:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2018-12-02 21:55:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 21:55:20,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:55:20,746 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-12-02 21:55:20,746 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:55:20,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:55:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1401790500, now seen corresponding path program 3 times [2018-12-02 21:55:20,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:55:20,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:55:20,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:20,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:20,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 21:55:20,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:55:20,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:55:20,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:55:20,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 21:55:20,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:55:20,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:55:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 21:55:20,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:55:20,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 21:55:20,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:55:20,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:55:20,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:55:20,862 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 7 states. [2018-12-02 21:55:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:55:20,895 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-12-02 21:55:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:55:20,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-12-02 21:55:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:55:20,896 INFO L225 Difference]: With dead ends: 74 [2018-12-02 21:55:20,896 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 21:55:20,897 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-12-02 21:55:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 21:55:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-02 21:55:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 21:55:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-02 21:55:20,899 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 56 [2018-12-02 21:55:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:55:20,899 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-02 21:55:20,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:55:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-02 21:55:20,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 21:55:20,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:55:20,900 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-12-02 21:55:20,900 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:55:20,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:55:20,900 INFO L82 PathProgramCache]: Analyzing trace with hash -597157424, now seen corresponding path program 1 times [2018-12-02 21:55:20,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:55:20,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:55:20,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:20,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:55:20,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:55:20,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:55:20,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:55:20,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:20,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:55:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:55:20,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:55:20,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-02 21:55:20,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:55:20,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:55:20,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:55:20,972 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 5 states. [2018-12-02 21:55:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:55:20,998 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-12-02 21:55:20,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:55:20,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-02 21:55:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:55:20,999 INFO L225 Difference]: With dead ends: 67 [2018-12-02 21:55:20,999 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 21:55:20,999 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-12-02 21:55:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 21:55:21,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-02 21:55:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 21:55:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-02 21:55:21,001 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2018-12-02 21:55:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:55:21,001 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-02 21:55:21,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:55:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-02 21:55:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 21:55:21,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:55:21,002 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-12-02 21:55:21,002 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:55:21,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:55:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1328936515, now seen corresponding path program 1 times [2018-12-02 21:55:21,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:55:21,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:55:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:21,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:55:21,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:55:21,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:55:21,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:21,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:55:21,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:55:21,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:21,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:21,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:55:21,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:21,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:21,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 21:55:21,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:21,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:21,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-12-02 21:55:21,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:55:21,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 21:55:21,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:21,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:21,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:21,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-02 21:55:22,019 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-12-02 21:55:22,021 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-12-02 21:55:22,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:22,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:22,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:22,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2018-12-02 21:55:22,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:22,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:22,170 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-12-02 21:55:22,173 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-12-02 21:55:22,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:22,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:22,197 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:55:22,198 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-12-02 21:55:22,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:22,217 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-12-02 21:55:22,237 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-12-02 21:55:22,238 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:173 [2018-12-02 21:55:22,432 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-12-02 21:55:22,434 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-12-02 21:55:22,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:22,445 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:55:22,446 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-12-02 21:55:22,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:22,455 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:55:22,455 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-12-02 21:55:22,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:22,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:22,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:22,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:18 [2018-12-02 21:55:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:55:22,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:55:22,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 49 [2018-12-02 21:55:22,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-02 21:55:22,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-02 21:55:22,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2300, Unknown=0, NotChecked=0, Total=2450 [2018-12-02 21:55:22,532 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 50 states. [2018-12-02 21:55:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:55:24,815 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-02 21:55:24,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-02 21:55:24,816 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2018-12-02 21:55:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:55:24,816 INFO L225 Difference]: With dead ends: 77 [2018-12-02 21:55:24,816 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 21:55:24,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2018-12-02 21:55:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 21:55:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2018-12-02 21:55:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 21:55:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-12-02 21:55:24,819 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 57 [2018-12-02 21:55:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:55:24,820 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-12-02 21:55:24,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-02 21:55:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-12-02 21:55:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 21:55:24,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:55:24,820 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-12-02 21:55:24,821 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:55:24,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:55:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1328936514, now seen corresponding path program 1 times [2018-12-02 21:55:24,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:55:24,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:55:24,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:24,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:24,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:55:25,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:55:25,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:55:25,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:25,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:55:25,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:55:25,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:25,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:55:25,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:25,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:25,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 21:55:25,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:25,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:25,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 21:55:25,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:25,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 21:55:25,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:25,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:25,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-12-02 21:55:25,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:55:25,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 21:55:25,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:25,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:25,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:55:25,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 21:55:25,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:25,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:25,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:25,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:53 [2018-12-02 21:55:26,164 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-12-02 21:55:26,166 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-12-02 21:55:26,167 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:26,180 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-12-02 21:55:26,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:26,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-12-02 21:55:26,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:26,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 21:55:26,226 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-12-02 21:55:26,227 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-12-02 21:55:26,227 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:26,230 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:26,232 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-12-02 21:55:26,233 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-12-02 21:55:26,233 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:26,237 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:26,249 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-12-02 21:55:26,249 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:83, output treesize:43 [2018-12-02 21:55:28,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:28,395 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-12-02 21:55:28,400 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:55:28,400 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-12-02 21:55:28,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:28,476 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-12-02 21:55:28,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:28,540 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:28,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 21:55:28,711 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-12-02 21:55:28,715 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-12-02 21:55:28,715 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:28,767 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:55:28,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:28,770 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-12-02 21:55:28,771 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:28,794 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:28,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:28,800 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-12-02 21:55:28,804 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-12-02 21:55:28,804 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:28,821 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:28,823 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-12-02 21:55:28,826 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:55:28,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:28,829 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-12-02 21:55:28,829 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:28,839 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:28,888 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-12-02 21:55:28,888 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:161, output treesize:343 [2018-12-02 21:55:29,231 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-12-02 21:55:29,233 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:55:29,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:29,235 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-12-02 21:55:29,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:29,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:29,262 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-12-02 21:55:29,264 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:55:29,264 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-12-02 21:55:29,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:29,278 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-12-02 21:55:29,278 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:29,292 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:55:29,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:29,293 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-12-02 21:55:29,293 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:29,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:29,306 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-12-02 21:55:29,306 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:103, output treesize:28 [2018-12-02 21:55:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:55:29,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:55:29,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2018-12-02 21:55:29,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-02 21:55:29,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-02 21:55:29,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=3261, Unknown=1, NotChecked=0, Total=3422 [2018-12-02 21:55:29,396 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 59 states. [2018-12-02 21:55:30,570 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2018-12-02 21:55:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:55:54,443 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-12-02 21:55:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-02 21:55:54,444 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 57 [2018-12-02 21:55:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:55:54,444 INFO L225 Difference]: With dead ends: 80 [2018-12-02 21:55:54,444 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 21:55:54,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=692, Invalid=9398, Unknown=10, NotChecked=0, Total=10100 [2018-12-02 21:55:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 21:55:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-12-02 21:55:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 21:55:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-12-02 21:55:54,448 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 57 [2018-12-02 21:55:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:55:54,448 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-12-02 21:55:54,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-02 21:55:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-12-02 21:55:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 21:55:54,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:55:54,448 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-12-02 21:55:54,448 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:55:54,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:55:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash 660869819, now seen corresponding path program 1 times [2018-12-02 21:55:54,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:55:54,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:55:54,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:54,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:54,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:55:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 21:55:54,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:55:54,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:55:54,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:55:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:54,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:55:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:55:54,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:54,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:54,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:55:54,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:55:54,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 21:55:54,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:54,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:54,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:54,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 21:55:55,136 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-12-02 21:55:55,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 21:55:55,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:55,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:55,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-02 21:55:55,156 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-12-02 21:55:55,157 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:55,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:55,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:55,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:12 [2018-12-02 21:55:56,400 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-12-02 21:55:56,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:56,413 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:55:56,419 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-12-02 21:55:56,420 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-12-02 21:55:56,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:56,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:56,433 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-12-02 21:55:56,434 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-12-02 21:55:56,435 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:56,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:55:56,445 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-12-02 21:55:56,445 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:83, output treesize:38 [2018-12-02 21:55:56,580 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-12-02 21:55:56,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:55:56,582 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-12-02 21:55:56,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:55:56,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:56,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:55:56,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:7 [2018-12-02 21:55:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:55:56,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:55:56,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30] total 48 [2018-12-02 21:55:56,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-02 21:55:56,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-02 21:55:56,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2218, Unknown=1, NotChecked=0, Total=2352 [2018-12-02 21:55:56,631 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 49 states. [2018-12-02 21:56:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:56:01,638 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-12-02 21:56:01,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-02 21:56:01,638 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 60 [2018-12-02 21:56:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:56:01,639 INFO L225 Difference]: With dead ends: 80 [2018-12-02 21:56:01,639 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 21:56:01,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=389, Invalid=5158, Unknown=3, NotChecked=0, Total=5550 [2018-12-02 21:56:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 21:56:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-12-02 21:56:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 21:56:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-12-02 21:56:01,641 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 60 [2018-12-02 21:56:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:56:01,641 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-12-02 21:56:01,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-02 21:56:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-12-02 21:56:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 21:56:01,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:56:01,642 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-12-02 21:56:01,642 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:56:01,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:56:01,642 INFO L82 PathProgramCache]: Analyzing trace with hash -559259874, now seen corresponding path program 1 times [2018-12-02 21:56:01,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:56:01,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:56:01,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:01,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:01,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:56:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:56:02,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:56:02,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:56:02,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:56:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:02,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:56:02,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:56:02,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:02,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 21:56:02,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:02,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:02,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 21:56:05,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:56:05,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:56:05,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 21:56:05,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:05,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:56:05,729 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-12-02 21:56:05,738 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-12-02 21:56:05,739 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 21:56:05,749 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:56:05,759 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-12-02 21:56:05,759 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:28, output treesize:45 [2018-12-02 21:56:05,840 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-12-02 21:56:05,841 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-12-02 21:56:05,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:05,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:05,853 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-12-02 21:56:05,854 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-12-02 21:56:05,854 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:56:05,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:56:05,864 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-12-02 21:56:05,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-12-02 21:56:06,023 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-12-02 21:56:06,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,032 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-12-02 21:56:06,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,041 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-12-02 21:56:06,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:45 [2018-12-02 21:56:06,087 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-12-02 21:56:06,089 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-12-02 21:56:06,089 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:56:06,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:56:06,128 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-12-02 21:56:06,130 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-12-02 21:56:06,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,166 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-12-02 21:56:06,167 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-12-02 21:56:06,168 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:56:06,173 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:56:06,203 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-12-02 21:56:06,204 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-12-02 21:56:06,204 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,212 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,241 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-12-02 21:56:06,241 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:167, output treesize:121 [2018-12-02 21:56:06,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:56:06,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:56:06,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:56:06,472 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-12-02 21:56:06,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 21:56:06,483 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-12-02 21:56:06,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:58 [2018-12-02 21:56:06,529 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-12-02 21:56:06,530 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-12-02 21:56:06,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,549 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-12-02 21:56:06,550 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-12-02 21:56:06,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,568 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-12-02 21:56:06,569 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-12-02 21:56:06,569 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,574 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,585 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-12-02 21:56:06,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 21:56:06,586 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,589 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,598 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-12-02 21:56:06,598 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:86, output treesize:42 [2018-12-02 21:56:06,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:56:06,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:56:06,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:56:06,672 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-12-02 21:56:06,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:56:06,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:56:06,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-12-02 21:56:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:56:06,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:56:06,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-12-02 21:56:06,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-02 21:56:06,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-02 21:56:06,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2178, Unknown=10, NotChecked=0, Total=2352 [2018-12-02 21:56:06,765 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 49 states. [2018-12-02 21:56:37,181 WARN L180 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 21:56:45,109 WARN L180 SmtUtils]: Spent 641.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 21:56:58,009 WARN L180 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 21:57:10,566 WARN L180 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-02 21:57:18,821 WARN L180 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 25 [2018-12-02 21:58:42,142 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 40 [2018-12-02 21:59:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:59:13,709 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-12-02 21:59:13,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-02 21:59:13,710 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 62 [2018-12-02 21:59:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:59:13,710 INFO L225 Difference]: With dead ends: 77 [2018-12-02 21:59:13,710 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 21:59:13,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 130.7s TimeCoverageRelationStatistics Valid=693, Invalid=5002, Unknown=157, NotChecked=0, Total=5852 [2018-12-02 21:59:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 21:59:13,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-02 21:59:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 21:59:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-02 21:59:13,713 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2018-12-02 21:59:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:59:13,713 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-02 21:59:13,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-02 21:59:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-02 21:59:13,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 21:59:13,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:59:13,714 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-12-02 21:59:13,714 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:59:13,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:59:13,714 INFO L82 PathProgramCache]: Analyzing trace with hash -604503808, now seen corresponding path program 2 times [2018-12-02 21:59:13,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:59:13,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:59:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:59:13,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:59:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:59:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:59:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:59:14,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:59:14,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:59:14,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 21:59:14,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 21:59:14,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:59:14,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:59:15,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 21:59:15,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 21:59:15,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:59:15,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:59:15,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:59:15,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:47 [2018-12-02 21:59:16,580 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-12-02 21:59:16,582 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-12-02 21:59:16,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:59:16,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:59:16,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:59:16,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2018-12-02 21:59:17,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:59:17,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:59:17,181 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-12-02 21:59:17,187 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-12-02 21:59:17,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:59:17,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:59:17,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:59:17,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:83 [2018-12-02 21:59:17,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:59:17,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:59:17,390 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-12-02 21:59:17,391 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-12-02 21:59:17,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:59:17,403 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:59:17,403 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-12-02 21:59:17,404 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:59:17,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:59:17,423 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-12-02 21:59:17,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:59 [2018-12-02 21:59:17,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:59:17,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:59:17,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:59:17,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:59:17,588 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-12-02 21:59:17,590 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:59:17,590 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-12-02 21:59:17,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:59:17,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:59:17,604 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-12-02 21:59:17,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2018-12-02 21:59:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:59:17,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:59:17,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 57 [2018-12-02 21:59:17,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-02 21:59:17,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-02 21:59:17,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3120, Unknown=2, NotChecked=0, Total=3306 [2018-12-02 21:59:17,689 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 58 states. [2018-12-02 21:59:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:59:20,107 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-12-02 21:59:20,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 21:59:20,108 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 69 [2018-12-02 21:59:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:59:20,108 INFO L225 Difference]: With dead ends: 83 [2018-12-02 21:59:20,109 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 21:59:20,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=259, Invalid=4161, Unknown=2, NotChecked=0, Total=4422 [2018-12-02 21:59:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 21:59:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-12-02 21:59:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 21:59:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-02 21:59:20,112 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2018-12-02 21:59:20,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:59:20,112 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-02 21:59:20,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-02 21:59:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-02 21:59:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 21:59:20,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:59:20,113 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-12-02 21:59:20,113 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-02 21:59:20,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:59:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1556674419, now seen corresponding path program 2 times [2018-12-02 21:59:20,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:59:20,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:59:20,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:59:20,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:59:20,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:59:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:59:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 21:59:20,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:59:20,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:59:20,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:59:20,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:59:20,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:59:20,140 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 6 states. [2018-12-02 21:59:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:59:20,157 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-02 21:59:20,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:59:20,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-02 21:59:20,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:59:20,157 INFO L225 Difference]: With dead ends: 59 [2018-12-02 21:59:20,157 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 21:59:20,158 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-12-02 21:59:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 21:59:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 21:59:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 21:59:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 21:59:20,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-12-02 21:59:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:59:20,158 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:59:20,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:59:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:59:20,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 21:59:20,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:59:20 BoogieIcfgContainer [2018-12-02 21:59:20,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:59:20,161 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:59:20,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:59:20,162 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:59:20,162 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:54:30" (3/4) ... [2018-12-02 21:59:20,165 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 21:59:20,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 21:59:20,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-02 21:59:20,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-02 21:59:20,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-02 21:59:20,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-12-02 21:59:20,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 21:59:20,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_remove_first [2018-12-02 21:59:20,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-02 21:59:20,172 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-12-02 21:59:20,173 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 21:59:20,173 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 21:59:20,198 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_04f0f3cd-f9f7-4468-a51d-748044716378/bin-2019/uautomizer/witness.graphml [2018-12-02 21:59:20,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:59:20,199 INFO L168 Benchmark]: Toolchain (without parser) took 290501.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 950.6 MB in the beginning and 877.4 MB in the end (delta: 73.2 MB). Peak memory consumption was 263.0 MB. Max. memory is 11.5 GB. [2018-12-02 21:59:20,199 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:59:20,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-12-02 21:59:20,199 INFO L168 Benchmark]: Boogie Preprocessor took 31.43 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-12-02 21:59:20,200 INFO L168 Benchmark]: RCFGBuilder took 284.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-12-02 21:59:20,200 INFO L168 Benchmark]: TraceAbstraction took 289850.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 885.2 MB in the end (delta: 177.9 MB). Peak memory consumption was 229.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:59:20,200 INFO L168 Benchmark]: Witness Printer took 36.85 ms. Allocated memory is still 1.2 GB. Free memory was 885.2 MB in the beginning and 877.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:59:20,201 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.43 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 284.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 289850.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 885.2 MB in the end (delta: 177.9 MB). Peak memory consumption was 229.8 MB. Max. memory is 11.5 GB. * Witness Printer took 36.85 ms. Allocated memory is still 1.2 GB. Free memory was 885.2 MB in the beginning and 877.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. 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: 586]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: 583]: free always succeeds For all program executions holds that free 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: 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: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: 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 - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 75 locations, 19 error locations. SAFE Result, 289.8s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 260.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 964 SDtfs, 1183 SDslu, 6350 SDs, 0 SdLazy, 11239 SolverSat, 336 SolverUnsat, 145 SolverUnknown, 0 SolverNotchecked, 109.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1118 GetRequests, 498 SyntacticMatches, 21 SemanticMatches, 599 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7378 ImplicationChecksByTransitivity, 175.2s 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.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 93 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 28.5s 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...