./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_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/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_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/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-08 13:45:52,178 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 13:45:52,179 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 13:45:52,185 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 13:45:52,185 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 13:45:52,186 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 13:45:52,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 13:45:52,187 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 13:45:52,188 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 13:45:52,189 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 13:45:52,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 13:45:52,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 13:45:52,190 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 13:45:52,190 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 13:45:52,191 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 13:45:52,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 13:45:52,191 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 13:45:52,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 13:45:52,193 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 13:45:52,194 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 13:45:52,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 13:45:52,195 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 13:45:52,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 13:45:52,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 13:45:52,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 13:45:52,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 13:45:52,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 13:45:52,198 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 13:45:52,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 13:45:52,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 13:45:52,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 13:45:52,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 13:45:52,199 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 13:45:52,199 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 13:45:52,200 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 13:45:52,200 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 13:45:52,200 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 13:45:52,207 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 13:45:52,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 13:45:52,208 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 13:45:52,208 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 13:45:52,208 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 13:45:52,209 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 13:45:52,209 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 13:45:52,209 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 13:45:52,209 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 13:45:52,209 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 13:45:52,209 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 13:45:52,209 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 13:45:52,209 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 13:45:52,209 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 13:45:52,209 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 13:45:52,209 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 13:45:52,210 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 13:45:52,210 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 13:45:52,210 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 13:45:52,210 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 13:45:52,210 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 13:45:52,210 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 13:45:52,210 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 13:45:52,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 13:45:52,210 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 13:45:52,210 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 13:45:52,210 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 13:45:52,211 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 13:45:52,211 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_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/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-08 13:45:52,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 13:45:52,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 13:45:52,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 13:45:52,237 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 13:45:52,237 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 13:45:52,238 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 13:45:52,272 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/data/537947e8c/172ac8aa11e94803b949769934f720ba/FLAGee1eb433b [2018-12-08 13:45:52,741 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 13:45:52,741 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 13:45:52,747 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/data/537947e8c/172ac8aa11e94803b949769934f720ba/FLAGee1eb433b [2018-12-08 13:45:52,755 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/data/537947e8c/172ac8aa11e94803b949769934f720ba [2018-12-08 13:45:52,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 13:45:52,758 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 13:45:52,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 13:45:52,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 13:45:52,760 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 13:45:52,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:45:52" (1/1) ... [2018-12-08 13:45:52,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b06587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:45:52, skipping insertion in model container [2018-12-08 13:45:52,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:45:52" (1/1) ... [2018-12-08 13:45:52,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 13:45:52,784 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 13:45:52,929 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:45:52,935 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 13:45:52,997 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:45:53,018 INFO L195 MainTranslator]: Completed translation [2018-12-08 13:45:53,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:45:53 WrapperNode [2018-12-08 13:45:53,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 13:45:53,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 13:45:53,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 13:45:53,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 13:45:53,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:45:53" (1/1) ... [2018-12-08 13:45:53,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:45:53" (1/1) ... [2018-12-08 13:45:53,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:45:53" (1/1) ... [2018-12-08 13:45:53,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:45:53" (1/1) ... [2018-12-08 13:45:53,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:45:53" (1/1) ... [2018-12-08 13:45:53,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:45:53" (1/1) ... [2018-12-08 13:45:53,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:45:53" (1/1) ... [2018-12-08 13:45:53,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 13:45:53,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 13:45:53,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 13:45:53,050 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 13:45:53,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:45:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 13:45:53,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 13:45:53,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 13:45:53,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 13:45:53,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 13:45:53,083 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 13:45:53,083 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-08 13:45:53,083 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-08 13:45:53,083 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_first [2018-12-08 13:45:53,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 13:45:53,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 13:45:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 13:45:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 13:45:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 13:45:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 13:45:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 13:45:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 13:45:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 13:45:53,084 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 13:45:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 13:45:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 13:45:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 13:45:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 13:45:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 13:45:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 13:45:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 13:45:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 13:45:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 13:45:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 13:45:53,085 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 13:45:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 13:45:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 13:45:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 13:45:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-08 13:45:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 13:45:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 13:45:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-08 13:45:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 13:45:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 13:45:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-08 13:45:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 13:45:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 13:45:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 13:45:53,089 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 13:45:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 13:45:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 13:45:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 13:45:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 13:45:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 13:45:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 13:45:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 13:45:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 13:45:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 13:45:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 13:45:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-08 13:45:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_first [2018-12-08 13:45:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 13:45:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 13:45:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 13:45:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 13:45:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 13:45:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 13:45:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 13:45:53,366 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 13:45:53,366 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 13:45:53,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:45:53 BoogieIcfgContainer [2018-12-08 13:45:53,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 13:45:53,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 13:45:53,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 13:45:53,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 13:45:53,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 01:45:52" (1/3) ... [2018-12-08 13:45:53,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62dcb9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 01:45:53, skipping insertion in model container [2018-12-08 13:45:53,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:45:53" (2/3) ... [2018-12-08 13:45:53,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62dcb9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 01:45:53, skipping insertion in model container [2018-12-08 13:45:53,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:45:53" (3/3) ... [2018-12-08 13:45:53,372 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 13:45:53,381 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 13:45:53,386 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-12-08 13:45:53,396 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-12-08 13:45:53,411 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 13:45:53,412 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 13:45:53,412 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 13:45:53,412 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 13:45:53,412 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 13:45:53,412 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 13:45:53,412 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 13:45:53,412 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 13:45:53,412 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 13:45:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-12-08 13:45:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 13:45:53,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:45:53,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:45:53,429 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:45:53,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:45:53,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1174307177, now seen corresponding path program 1 times [2018-12-08 13:45:53,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:45:53,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:45:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:45:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:45:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:45:53,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:45:53,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 13:45:53,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:45:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:45:53,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:45:53,545 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2018-12-08 13:45:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:45:53,586 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-12-08 13:45:53,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:45:53,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 13:45:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:45:53,592 INFO L225 Difference]: With dead ends: 65 [2018-12-08 13:45:53,593 INFO L226 Difference]: Without dead ends: 58 [2018-12-08 13:45:53,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:45:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-08 13:45:53,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-08 13:45:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 13:45:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-08 13:45:53,616 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 13 [2018-12-08 13:45:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:45:53,617 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-08 13:45:53,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:45:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-08 13:45:53,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 13:45:53,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:45:53,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:45:53,617 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:45:53,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:45:53,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1174307178, now seen corresponding path program 1 times [2018-12-08 13:45:53,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:45:53,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:45:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:45:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:45:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:45:53,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:45:53,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 13:45:53,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 13:45:53,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 13:45:53,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:45:53,660 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 3 states. [2018-12-08 13:45:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:45:53,682 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-12-08 13:45:53,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 13:45:53,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 13:45:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:45:53,683 INFO L225 Difference]: With dead ends: 56 [2018-12-08 13:45:53,683 INFO L226 Difference]: Without dead ends: 56 [2018-12-08 13:45:53,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 13:45:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-08 13:45:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-08 13:45:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 13:45:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-12-08 13:45:53,687 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 13 [2018-12-08 13:45:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:45:53,687 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-12-08 13:45:53,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 13:45:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-12-08 13:45:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 13:45:53,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:45:53,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:45:53,688 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:45:53,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:45:53,688 INFO L82 PathProgramCache]: Analyzing trace with hash -607396290, now seen corresponding path program 1 times [2018-12-08 13:45:53,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:45:53,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:45:53,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:45:53,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:45:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:45:53,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:45:53,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 13:45:53,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 13:45:53,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 13:45:53,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 13:45:53,713 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 4 states. [2018-12-08 13:45:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:45:53,726 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-12-08 13:45:53,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 13:45:53,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-08 13:45:53,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:45:53,727 INFO L225 Difference]: With dead ends: 59 [2018-12-08 13:45:53,728 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 13:45:53,728 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-08 13:45:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 13:45:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-12-08 13:45:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 13:45:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-08 13:45:53,733 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 15 [2018-12-08 13:45:53,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:45:53,733 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-08 13:45:53,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 13:45:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-08 13:45:53,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-08 13:45:53,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:45:53,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:45:53,734 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:45:53,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:45:53,734 INFO L82 PathProgramCache]: Analyzing trace with hash 407818055, now seen corresponding path program 1 times [2018-12-08 13:45:53,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:45:53,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:45:53,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:45:53,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:45:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:45:53,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:45:53,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 13:45:53,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 13:45:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 13:45:53,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 13:45:53,765 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 5 states. [2018-12-08 13:45:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:45:53,784 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-08 13:45:53,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 13:45:53,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-08 13:45:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:45:53,785 INFO L225 Difference]: With dead ends: 68 [2018-12-08 13:45:53,785 INFO L226 Difference]: Without dead ends: 65 [2018-12-08 13:45:53,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 13:45:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-08 13:45:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-12-08 13:45:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 13:45:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-08 13:45:53,789 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 17 [2018-12-08 13:45:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:45:53,789 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-08 13:45:53,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 13:45:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-08 13:45:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 13:45:53,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:45:53,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:45:53,790 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:45:53,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:45:53,790 INFO L82 PathProgramCache]: Analyzing trace with hash 395778245, now seen corresponding path program 1 times [2018-12-08 13:45:53,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:45:53,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:45:53,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:45:53,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:45:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:45:53,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:45:53,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 13:45:53,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 13:45:53,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 13:45:53,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 13:45:53,823 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 6 states. [2018-12-08 13:45:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:45:53,907 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-12-08 13:45:53,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 13:45:53,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 13:45:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:45:53,909 INFO L225 Difference]: With dead ends: 58 [2018-12-08 13:45:53,909 INFO L226 Difference]: Without dead ends: 58 [2018-12-08 13:45:53,909 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-08 13:45:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-08 13:45:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-08 13:45:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 13:45:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-08 13:45:53,912 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 19 [2018-12-08 13:45:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:45:53,912 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-08 13:45:53,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 13:45:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-08 13:45:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 13:45:53,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:45:53,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:45:53,913 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:45:53,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:45:53,913 INFO L82 PathProgramCache]: Analyzing trace with hash 395778246, now seen corresponding path program 1 times [2018-12-08 13:45:53,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:45:53,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:45:53,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:45:53,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:45:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:45:53,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:45:53,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 13:45:53,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 13:45:53,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 13:45:53,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 13:45:53,985 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 6 states. [2018-12-08 13:45:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:45:54,047 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-08 13:45:54,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 13:45:54,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 13:45:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:45:54,048 INFO L225 Difference]: With dead ends: 57 [2018-12-08 13:45:54,048 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 13:45:54,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 13:45:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 13:45:54,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-08 13:45:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 13:45:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-12-08 13:45:54,051 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 19 [2018-12-08 13:45:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:45:54,051 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-12-08 13:45:54,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 13:45:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-12-08 13:45:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 13:45:54,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:45:54,052 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-08 13:45:54,052 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:45:54,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:45:54,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1030344892, now seen corresponding path program 1 times [2018-12-08 13:45:54,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:45:54,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:45:54,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:54,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:45:54,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:45:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:45:54,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:45:54,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:45:54,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:45:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:45:54,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:45:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:45:54,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:45:54,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-08 13:45:54,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 13:45:54,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 13:45:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 13:45:54,175 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 6 states. [2018-12-08 13:45:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:45:54,201 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-08 13:45:54,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 13:45:54,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-08 13:45:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:45:54,202 INFO L225 Difference]: With dead ends: 70 [2018-12-08 13:45:54,203 INFO L226 Difference]: Without dead ends: 67 [2018-12-08 13:45:54,203 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-08 13:45:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-08 13:45:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-12-08 13:45:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-08 13:45:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-08 13:45:54,207 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 30 [2018-12-08 13:45:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:45:54,208 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-08 13:45:54,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 13:45:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-08 13:45:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 13:45:54,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:45:54,209 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-08 13:45:54,210 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:45:54,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:45:54,210 INFO L82 PathProgramCache]: Analyzing trace with hash -911117721, now seen corresponding path program 2 times [2018-12-08 13:45:54,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:45:54,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:45:54,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:54,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:45:54,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:45:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:45:54,555 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-08 13:45:54,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:45:54,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:45:54,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 13:45:54,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 13:45:54,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 13:45:54,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:45:54,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 13:45:54,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:45:54,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 13:45:54,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:45:54,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:45:54,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 13:46:01,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:01,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:01,588 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-08 13:46:01,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:01,592 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-08 13:46:01,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:01,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:01,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:01,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:01,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:01,625 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-08 13:46:01,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:01,633 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-08 13:46:01,634 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-12-08 13:46:01,704 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-08 13:46:01,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:01,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2018-12-08 13:46:01,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-08 13:46:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-08 13:46:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=422, Unknown=6, NotChecked=0, Total=506 [2018-12-08 13:46:01,720 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 23 states. [2018-12-08 13:46:03,153 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-08 13:46:03,782 WARN L180 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-08 13:46:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:04,282 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-12-08 13:46:04,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 13:46:04,282 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-12-08 13:46:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:46:04,283 INFO L225 Difference]: With dead ends: 97 [2018-12-08 13:46:04,283 INFO L226 Difference]: Without dead ends: 97 [2018-12-08 13:46:04,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=154, Invalid=831, Unknown=7, NotChecked=0, Total=992 [2018-12-08 13:46:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-08 13:46:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-12-08 13:46:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-08 13:46:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2018-12-08 13:46:04,287 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 43 [2018-12-08 13:46:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:46:04,287 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-12-08 13:46:04,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-08 13:46:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2018-12-08 13:46:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 13:46:04,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:46:04,288 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-08 13:46:04,288 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:46:04,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:04,288 INFO L82 PathProgramCache]: Analyzing trace with hash -911117722, now seen corresponding path program 1 times [2018-12-08 13:46:04,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:04,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:04,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:46:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:04,407 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-08 13:46:04,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:04,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:46:04,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:04,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:04,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 13:46:04,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:04,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:04,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 13:46:04,684 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-08 13:46:06,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:06,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:06,723 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-08 13:46:06,726 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-08 13:46:06,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:06,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:06,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 13:46:06,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-12-08 13:46:06,779 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-08 13:46:06,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:06,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-12-08 13:46:06,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 13:46:06,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 13:46:06,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=194, Unknown=2, NotChecked=28, Total=272 [2018-12-08 13:46:06,795 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 17 states. [2018-12-08 13:46:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:40,992 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-12-08 13:46:40,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 13:46:40,993 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-12-08 13:46:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:46:40,993 INFO L225 Difference]: With dead ends: 99 [2018-12-08 13:46:40,993 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 13:46:40,993 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-08 13:46:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 13:46:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-12-08 13:46:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-08 13:46:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2018-12-08 13:46:40,997 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 43 [2018-12-08 13:46:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:46:40,997 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2018-12-08 13:46:40,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 13:46:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2018-12-08 13:46:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 13:46:40,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:46:40,998 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:40,998 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:46:40,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:40,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1820121741, now seen corresponding path program 1 times [2018-12-08 13:46:40,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:40,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:40,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:41,085 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-08 13:46:41,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:46:41,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 13:46:41,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 13:46:41,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 13:46:41,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 13:46:41,086 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 13 states. [2018-12-08 13:46:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:41,305 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2018-12-08 13:46:41,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 13:46:41,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-12-08 13:46:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:46:41,306 INFO L225 Difference]: With dead ends: 108 [2018-12-08 13:46:41,306 INFO L226 Difference]: Without dead ends: 108 [2018-12-08 13:46:41,306 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-08 13:46:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-08 13:46:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2018-12-08 13:46:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-08 13:46:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-12-08 13:46:41,311 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 44 [2018-12-08 13:46:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:46:41,311 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-12-08 13:46:41,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 13:46:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-12-08 13:46:41,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 13:46:41,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:46:41,312 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:41,312 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:46:41,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1820121742, now seen corresponding path program 1 times [2018-12-08 13:46:41,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:41,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:41,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:41,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:41,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:41,487 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-08 13:46:41,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:41,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:46:41,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:41,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:41,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 13:46:41,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:41,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:41,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 13:46:41,730 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-08 13:46:41,732 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-08 13:46:41,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:41,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:41,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-08 13:46:41,740 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-08 13:46:41,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:41,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:41,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:41,746 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:14 [2018-12-08 13:46:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 13:46:41,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 13:46:41,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 29 [2018-12-08 13:46:41,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-08 13:46:41,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-08 13:46:41,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2018-12-08 13:46:41,782 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 30 states. [2018-12-08 13:46:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:42,263 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2018-12-08 13:46:42,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 13:46:42,264 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-12-08 13:46:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:46:42,265 INFO L225 Difference]: With dead ends: 111 [2018-12-08 13:46:42,265 INFO L226 Difference]: Without dead ends: 111 [2018-12-08 13:46:42,265 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-08 13:46:42,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-08 13:46:42,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 94. [2018-12-08 13:46:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-08 13:46:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2018-12-08 13:46:42,269 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 44 [2018-12-08 13:46:42,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:46:42,269 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2018-12-08 13:46:42,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-08 13:46:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2018-12-08 13:46:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 13:46:42,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:46:42,270 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:46:42,270 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:46:42,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:42,270 INFO L82 PathProgramCache]: Analyzing trace with hash -715272213, now seen corresponding path program 1 times [2018-12-08 13:46:42,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:42,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:42,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:42,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:42,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 13:46:42,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:46:42,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 13:46:42,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 13:46:42,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 13:46:42,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 13:46:42,348 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand 13 states. [2018-12-08 13:46:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:42,526 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2018-12-08 13:46:42,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 13:46:42,526 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-12-08 13:46:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:46:42,527 INFO L225 Difference]: With dead ends: 110 [2018-12-08 13:46:42,527 INFO L226 Difference]: Without dead ends: 110 [2018-12-08 13:46:42,527 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-08 13:46:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-08 13:46:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-12-08 13:46:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 13:46:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2018-12-08 13:46:42,531 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 47 [2018-12-08 13:46:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:46:42,531 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2018-12-08 13:46:42,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 13:46:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2018-12-08 13:46:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 13:46:42,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:46:42,532 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-08 13:46:42,532 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:46:42,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash -698602002, now seen corresponding path program 1 times [2018-12-08 13:46:42,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:42,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:42,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 13:46:42,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:46:42,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 13:46:42,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 13:46:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 13:46:42,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 13:46:42,559 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand 5 states. [2018-12-08 13:46:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:42,611 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-12-08 13:46:42,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 13:46:42,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-08 13:46:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:46:42,613 INFO L225 Difference]: With dead ends: 99 [2018-12-08 13:46:42,613 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 13:46:42,613 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-08 13:46:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 13:46:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-08 13:46:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-08 13:46:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-12-08 13:46:42,617 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 48 [2018-12-08 13:46:42,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:46:42,618 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-12-08 13:46:42,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 13:46:42,618 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-12-08 13:46:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 13:46:42,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:46:42,619 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-08 13:46:42,619 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:46:42,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:42,619 INFO L82 PathProgramCache]: Analyzing trace with hash -181825458, now seen corresponding path program 1 times [2018-12-08 13:46:42,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:42,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:42,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:42,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:42,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:42,842 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-08 13:46:42,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:42,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:46:42,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:42,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:42,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 13:46:42,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:42,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:42,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 13:46:43,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:43,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:43,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:43,100 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-08 13:46:43,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:43,103 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-08 13:46:43,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2018-12-08 13:46:43,183 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-08 13:46:43,184 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-08 13:46:43,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:43,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:43,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:43,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-08 13:46:43,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:43,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 13:46:43,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:43,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:46:43,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-08 13:46:43,227 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-08 13:46:43,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:43,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 33 [2018-12-08 13:46:43,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-08 13:46:43,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-08 13:46:43,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 13:46:43,243 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 34 states. [2018-12-08 13:46:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:46,664 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-12-08 13:46:46,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 13:46:46,664 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 49 [2018-12-08 13:46:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:46:46,664 INFO L225 Difference]: With dead ends: 107 [2018-12-08 13:46:46,664 INFO L226 Difference]: Without dead ends: 107 [2018-12-08 13:46:46,665 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-08 13:46:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-08 13:46:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-12-08 13:46:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-08 13:46:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-12-08 13:46:46,668 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 49 [2018-12-08 13:46:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:46:46,668 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-12-08 13:46:46,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-08 13:46:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-12-08 13:46:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 13:46:46,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:46:46,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-08 13:46:46,669 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:46:46,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash 522283054, now seen corresponding path program 1 times [2018-12-08 13:46:46,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:46,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:46,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 13:46:46,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:46:46,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 13:46:46,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 13:46:46,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 13:46:46,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 13:46:46,699 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 5 states. [2018-12-08 13:46:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:46,745 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-12-08 13:46:46,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 13:46:46,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-08 13:46:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:46:46,746 INFO L225 Difference]: With dead ends: 103 [2018-12-08 13:46:46,746 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 13:46:46,746 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-08 13:46:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 13:46:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-08 13:46:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-08 13:46:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2018-12-08 13:46:46,750 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 54 [2018-12-08 13:46:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:46:46,750 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2018-12-08 13:46:46,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 13:46:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2018-12-08 13:46:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 13:46:46,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:46:46,751 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-08 13:46:46,751 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:46:46,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1401790500, now seen corresponding path program 3 times [2018-12-08 13:46:46,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:46,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:46,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:46,790 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-08 13:46:46,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:46,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:46:46,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 13:46:46,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 13:46:46,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 13:46:46,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:46,860 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-08 13:46:46,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:46,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-08 13:46:46,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 13:46:46,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 13:46:46,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 13:46:46,875 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 7 states. [2018-12-08 13:46:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:46,898 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-12-08 13:46:46,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 13:46:46,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-12-08 13:46:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:46:46,899 INFO L225 Difference]: With dead ends: 74 [2018-12-08 13:46:46,899 INFO L226 Difference]: Without dead ends: 65 [2018-12-08 13:46:46,899 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-08 13:46:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-08 13:46:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-08 13:46:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-08 13:46:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-08 13:46:46,901 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 56 [2018-12-08 13:46:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:46:46,901 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-08 13:46:46,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 13:46:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-08 13:46:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 13:46:46,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:46:46,902 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-08 13:46:46,902 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:46:46,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash -597157424, now seen corresponding path program 1 times [2018-12-08 13:46:46,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:46,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:46,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:46,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:46:46,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 13:46:46,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:46,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:46:46,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:46,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 13:46:46,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:46,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-08 13:46:46,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 13:46:46,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 13:46:46,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 13:46:46,983 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 5 states. [2018-12-08 13:46:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:46,998 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-12-08 13:46:46,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 13:46:46,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-08 13:46:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:46:46,998 INFO L225 Difference]: With dead ends: 67 [2018-12-08 13:46:46,998 INFO L226 Difference]: Without dead ends: 67 [2018-12-08 13:46:46,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-08 13:46:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-08 13:46:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-08 13:46:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-08 13:46:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-08 13:46:47,000 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2018-12-08 13:46:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:46:47,000 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-08 13:46:47,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 13:46:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-08 13:46:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 13:46:47,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:46:47,001 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-08 13:46:47,001 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:46:47,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:47,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1328936515, now seen corresponding path program 1 times [2018-12-08 13:46:47,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:47,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:47,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:47,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:47,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:47,446 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-08 13:46:47,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:47,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:46:47,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:47,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:47,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 13:46:47,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:47,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:47,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 13:46:47,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:47,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:47,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 13:46:47,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:47,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:47,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-12-08 13:46:47,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 13:46:47,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 13:46:47,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:47,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:47,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:46:47,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-08 13:46:48,015 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-08 13:46:48,018 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-08 13:46:48,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:48,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:48,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:48,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2018-12-08 13:46:48,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:48,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:48,175 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-08 13:46:48,178 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-08 13:46:48,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:46:48,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:48,201 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:46:48,202 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-08 13:46:48,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:48,221 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-08 13:46:48,244 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-08 13:46:48,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:173 [2018-12-08 13:46:48,468 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-08 13:46:48,470 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-08 13:46:48,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:48,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:46:48,483 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-08 13:46:48,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:48,495 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:46:48,496 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-08 13:46:48,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:48,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:48,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:46:48,511 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:18 [2018-12-08 13:46:48,569 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-08 13:46:48,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:48,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 49 [2018-12-08 13:46:48,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-08 13:46:48,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-08 13:46:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2300, Unknown=0, NotChecked=0, Total=2450 [2018-12-08 13:46:48,586 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 50 states. [2018-12-08 13:46:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:46:50,083 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-08 13:46:50,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-08 13:46:50,083 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2018-12-08 13:46:50,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:46:50,084 INFO L225 Difference]: With dead ends: 77 [2018-12-08 13:46:50,084 INFO L226 Difference]: Without dead ends: 77 [2018-12-08 13:46:50,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2018-12-08 13:46:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-08 13:46:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2018-12-08 13:46:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-08 13:46:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-12-08 13:46:50,087 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 57 [2018-12-08 13:46:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:46:50,087 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-12-08 13:46:50,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-08 13:46:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-12-08 13:46:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 13:46:50,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:46:50,088 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-08 13:46:50,088 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:46:50,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:46:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1328936514, now seen corresponding path program 1 times [2018-12-08 13:46:50,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:46:50,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:46:50,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:50,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:46:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:50,631 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-08 13:46:50,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:46:50,631 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:46:50,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:46:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:46:50,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:46:50,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 13:46:50,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:50,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 13:46:50,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:50,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:50,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 13:46:50,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:50,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:50,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 13:46:50,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:50,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 13:46:50,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:50,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:50,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-12-08 13:46:51,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 13:46:51,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 13:46:51,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:51,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:51,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 13:46:51,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 13:46:51,098 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:51,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:51,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:46:51,108 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:53 [2018-12-08 13:46:51,378 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-08 13:46:51,380 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-08 13:46:51,380 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:46:51,394 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-08 13:46:51,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:46:51,409 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-08 13:46:51,409 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-08 13:46:51,423 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-08 13:46:51,442 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-08 13:46:51,443 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-08 13:46:51,444 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:51,447 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:51,449 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-08 13:46:51,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-12-08 13:46:51,450 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:51,456 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:51,467 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-08 13:46:51,467 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:83, output treesize:43 [2018-12-08 13:46:53,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:53,731 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-08 13:46:53,735 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:46:53,736 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-08 13:46:53,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:53,805 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-08 13:46:53,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:46:53,871 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:46:53,938 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-08 13:46:54,045 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-08 13:46:54,049 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-08 13:46:54,050 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,101 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:46:54,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:54,104 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-08 13:46:54,105 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,127 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:54,133 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-08 13:46:54,136 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-08 13:46:54,137 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,150 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,153 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-08 13:46:54,155 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:46:54,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:54,158 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-08 13:46:54,158 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,168 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,217 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-08 13:46:54,218 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:161, output treesize:343 [2018-12-08 13:46:54,551 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-08 13:46:54,553 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:46:54,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:54,554 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-08 13:46:54,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,592 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-08 13:46:54,595 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:46:54,595 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-08 13:46:54,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,607 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-08 13:46:54,607 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,618 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:46:54,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:46:54,619 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-08 13:46:54,620 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:46:54,636 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-08 13:46:54,637 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:103, output treesize:28 [2018-12-08 13:46:54,714 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-08 13:46:54,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:46:54,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2018-12-08 13:46:54,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-08 13:46:54,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-08 13:46:54,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=3261, Unknown=1, NotChecked=0, Total=3422 [2018-12-08 13:46:54,730 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 59 states. [2018-12-08 13:47:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:47:19,821 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-12-08 13:47:19,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-08 13:47:19,822 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 57 [2018-12-08 13:47:19,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:47:19,822 INFO L225 Difference]: With dead ends: 80 [2018-12-08 13:47:19,822 INFO L226 Difference]: Without dead ends: 80 [2018-12-08 13:47:19,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=692, Invalid=9398, Unknown=10, NotChecked=0, Total=10100 [2018-12-08 13:47:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-08 13:47:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-12-08 13:47:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-08 13:47:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-12-08 13:47:19,825 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 57 [2018-12-08 13:47:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:47:19,825 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-12-08 13:47:19,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-08 13:47:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-12-08 13:47:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 13:47:19,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:47:19,826 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-08 13:47:19,826 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:47:19,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:47:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash 660869819, now seen corresponding path program 1 times [2018-12-08 13:47:19,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:47:19,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:47:19,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:47:19,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:47:19,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:47:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:47:20,153 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-08 13:47:20,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:47:20,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:47:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:47:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:47:20,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:47:20,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 13:47:20,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:20,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:20,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 13:47:20,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 13:47:20,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 13:47:20,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:20,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:20,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:47:20,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-08 13:47:20,478 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-08 13:47:20,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 13:47:20,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:20,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:20,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-08 13:47:20,486 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-08 13:47:20,486 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:47:20,488 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:47:20,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:47:20,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:12 [2018-12-08 13:47:21,734 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-08 13:47:21,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:21,748 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:47:21,753 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-08 13:47:21,755 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-08 13:47:21,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:21,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:21,768 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-08 13:47:21,769 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-08 13:47:21,769 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-08 13:47:21,773 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-08 13:47:21,780 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-08 13:47:21,780 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:83, output treesize:38 [2018-12-08 13:47:21,927 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-08 13:47:21,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:47:21,929 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-08 13:47:21,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:21,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:21,942 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-08 13:47:21,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:7 [2018-12-08 13:47:21,969 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-08 13:47:21,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:47:21,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30] total 48 [2018-12-08 13:47:21,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-08 13:47:21,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-08 13:47:21,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2218, Unknown=1, NotChecked=0, Total=2352 [2018-12-08 13:47:21,984 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 49 states. [2018-12-08 13:47:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:47:26,840 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-12-08 13:47:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-08 13:47:26,841 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 60 [2018-12-08 13:47:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:47:26,841 INFO L225 Difference]: With dead ends: 80 [2018-12-08 13:47:26,841 INFO L226 Difference]: Without dead ends: 80 [2018-12-08 13:47:26,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=389, Invalid=5158, Unknown=3, NotChecked=0, Total=5550 [2018-12-08 13:47:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-08 13:47:26,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-12-08 13:47:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-08 13:47:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-12-08 13:47:26,845 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 60 [2018-12-08 13:47:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:47:26,845 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-12-08 13:47:26,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-08 13:47:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-12-08 13:47:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 13:47:26,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:47:26,846 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-08 13:47:26,846 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:47:26,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:47:26,846 INFO L82 PathProgramCache]: Analyzing trace with hash -559259874, now seen corresponding path program 1 times [2018-12-08 13:47:26,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:47:26,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:47:26,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:47:26,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:47:26,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:47:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:47:27,242 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-08 13:47:27,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:47:27,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:47:27,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:47:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:47:27,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:47:27,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 13:47:27,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:27,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 13:47:27,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:27,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:27,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 13:47:30,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:47:30,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:47:30,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 13:47:30,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:30,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:47:30,968 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-08 13:47:30,976 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-08 13:47:30,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 13:47:30,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 13:47:30,996 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-08 13:47:30,996 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:28, output treesize:45 [2018-12-08 13:47:31,074 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-08 13:47:31,075 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-08 13:47:31,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,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 18 treesize of output 16 [2018-12-08 13:47:31,088 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-08 13:47:31,089 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:47:31,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:47:31,099 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-08 13:47:31,099 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-12-08 13:47:31,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-12-08 13:47:31,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,260 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-08 13:47:31,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,268 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-08 13:47:31,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:45 [2018-12-08 13:47:31,318 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-08 13:47:31,320 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-08 13:47:31,320 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:47:31,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:47:31,357 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-08 13:47:31,359 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-08 13:47:31,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,392 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-08 13:47:31,394 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-08 13:47:31,395 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:47:31,399 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:47:31,427 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-08 13:47:31,428 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-08 13:47:31,429 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,434 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,460 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-08 13:47:31,461 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:167, output treesize:121 [2018-12-08 13:47:31,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:47:31,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:47:31,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:47:31,691 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-08 13:47:31,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-08 13:47:31,704 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-08 13:47:31,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:58 [2018-12-08 13:47:31,760 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-08 13:47:31,761 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-08 13:47:31,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,782 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-08 13:47:31,784 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-08 13:47:31,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,801 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-08 13:47:31,802 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-08 13:47:31,803 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,806 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,816 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-08 13:47:31,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-08 13:47:31,818 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,821 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,830 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-08 13:47:31,830 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:86, output treesize:42 [2018-12-08 13:47:31,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:47:31,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:47:31,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:47:31,903 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-08 13:47:31,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 13:47:31,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 13:47:31,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-12-08 13:47:31,955 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-08 13:47:31,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:47:31,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-12-08 13:47:31,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-08 13:47:31,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-08 13:47:31,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2178, Unknown=10, NotChecked=0, Total=2352 [2018-12-08 13:47:31,971 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 49 states. [2018-12-08 13:48:00,427 WARN L180 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-08 13:48:07,281 WARN L180 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-08 13:48:18,658 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-08 13:48:30,733 WARN L180 SmtUtils]: Spent 707.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-08 13:48:38,034 WARN L180 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 25 [2018-12-08 13:49:58,784 WARN L180 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 40 [2018-12-08 13:50:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:50:30,986 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-12-08 13:50:30,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-08 13:50:30,987 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 62 [2018-12-08 13:50:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:50:30,987 INFO L225 Difference]: With dead ends: 77 [2018-12-08 13:50:30,987 INFO L226 Difference]: Without dead ends: 77 [2018-12-08 13:50:30,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 122.1s TimeCoverageRelationStatistics Valid=693, Invalid=5012, Unknown=147, NotChecked=0, Total=5852 [2018-12-08 13:50:30,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-08 13:50:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-08 13:50:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-08 13:50:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-08 13:50:30,991 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2018-12-08 13:50:30,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:50:30,991 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-08 13:50:30,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-08 13:50:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-08 13:50:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 13:50:30,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:50:30,992 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-08 13:50:30,992 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:50:30,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:50:30,992 INFO L82 PathProgramCache]: Analyzing trace with hash -604503808, now seen corresponding path program 2 times [2018-12-08 13:50:30,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:50:30,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:50:30,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:50:30,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:50:30,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:50:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:31,662 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-08 13:50:31,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 13:50:31,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 13:50:31,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 13:50:31,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 13:50:31,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 13:50:31,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:50:32,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 13:50:32,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 13:50:32,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:50:32,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:50:32,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:50:32,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:47 [2018-12-08 13:50:35,807 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-08 13:50:35,808 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-08 13:50:35,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:50:35,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:50:35,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:50:35,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2018-12-08 13:50:35,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:50:35,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:50:35,954 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-08 13:50:35,955 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-08 13:50:35,956 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:50:35,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:50:35,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 13:50:35,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:83 [2018-12-08 13:50:36,123 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-08 13:50:36,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:50:36,141 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-08 13:50:36,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-08 13:50:36,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 13:50:36,152 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:50:36,153 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-08 13:50:36,153 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:50:36,160 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-08 13:50:36,172 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-08 13:50:36,172 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:59 [2018-12-08 13:50:36,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:50:36,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:50:36,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:50:36,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:50:36,335 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-08 13:50:36,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:50:36,338 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:50:36,338 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 26 treesize of output 48 [2018-12-08 13:50:36,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:50:36,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:50:36,352 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-08 13:50:36,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:62, output treesize:35 [2018-12-08 13:50:36,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-08 13:50:36,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 13:50:36,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 57 [2018-12-08 13:50:36,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-08 13:50:36,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-08 13:50:36,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3113, Unknown=7, NotChecked=0, Total=3306 [2018-12-08 13:50:36,439 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 58 states. [2018-12-08 13:50:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:50:40,095 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-12-08 13:50:40,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-08 13:50:40,096 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 69 [2018-12-08 13:50:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:50:40,096 INFO L225 Difference]: With dead ends: 83 [2018-12-08 13:50:40,096 INFO L226 Difference]: Without dead ends: 80 [2018-12-08 13:50:40,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=261, Invalid=4154, Unknown=7, NotChecked=0, Total=4422 [2018-12-08 13:50:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-08 13:50:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-12-08 13:50:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-08 13:50:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-08 13:50:40,099 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2018-12-08 13:50:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:50:40,099 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-08 13:50:40,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-08 13:50:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-08 13:50:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 13:50:40,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 13:50:40,099 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-08 13:50:40,100 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr8REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-08 13:50:40,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:50:40,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1556674419, now seen corresponding path program 2 times [2018-12-08 13:50:40,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:50:40,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:50:40,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:50:40,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:50:40,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:50:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:40,131 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-08 13:50:40,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:50:40,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 13:50:40,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 13:50:40,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 13:50:40,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 13:50:40,132 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 6 states. [2018-12-08 13:50:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:50:40,151 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-08 13:50:40,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 13:50:40,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-08 13:50:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 13:50:40,152 INFO L225 Difference]: With dead ends: 59 [2018-12-08 13:50:40,152 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 13:50:40,152 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-08 13:50:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 13:50:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 13:50:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 13:50:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 13:50:40,153 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-12-08 13:50:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 13:50:40,153 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:50:40,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 13:50:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 13:50:40,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 13:50:40,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 01:50:40 BoogieIcfgContainer [2018-12-08 13:50:40,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 13:50:40,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 13:50:40,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 13:50:40,157 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 13:50:40,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:45:53" (3/4) ... [2018-12-08 13:50:40,161 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 13:50:40,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 13:50:40,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-08 13:50:40,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-08 13:50:40,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-08 13:50:40,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-12-08 13:50:40,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 13:50:40,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_remove_first [2018-12-08 13:50:40,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-08 13:50:40,171 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-12-08 13:50:40,171 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-08 13:50:40,171 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 13:50:40,205 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e1f79e9f-a0e6-4d3e-a71c-7fcbe441bda4/bin-2019/uautomizer/witness.graphml [2018-12-08 13:50:40,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 13:50:40,206 INFO L168 Benchmark]: Toolchain (without parser) took 287448.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 956.0 MB in the beginning and 964.4 MB in the end (delta: -8.4 MB). Peak memory consumption was 190.8 MB. Max. memory is 11.5 GB. [2018-12-08 13:50:40,206 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:50:40,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-08 13:50:40,207 INFO L168 Benchmark]: Boogie Preprocessor took 30.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-08 13:50:40,207 INFO L168 Benchmark]: RCFGBuilder took 316.82 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: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2018-12-08 13:50:40,207 INFO L168 Benchmark]: TraceAbstraction took 286789.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.1 MB). Free memory was 1.1 GB in the beginning and 964.4 MB in the end (delta: 130.8 MB). Peak memory consumption was 164.9 MB. Max. memory is 11.5 GB. [2018-12-08 13:50:40,207 INFO L168 Benchmark]: Witness Printer took 48.22 ms. Allocated memory is still 1.2 GB. Free memory is still 964.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:50:40,208 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 316.82 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: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 286789.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.1 MB). Free memory was 1.1 GB in the beginning and 964.4 MB in the end (delta: 130.8 MB). Peak memory consumption was 164.9 MB. Max. memory is 11.5 GB. * Witness Printer took 48.22 ms. Allocated memory is still 1.2 GB. Free memory is still 964.4 MB. There was no memory consumed. 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: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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, 286.7s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 255.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 964 SDtfs, 1183 SDslu, 6348 SDs, 0 SdLazy, 11236 SolverSat, 336 SolverUnsat, 145 SolverUnknown, 0 SolverNotchecked, 113.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1118 GetRequests, 498 SyntacticMatches, 21 SemanticMatches, 599 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7377 ImplicationChecksByTransitivity, 168.1s 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.4s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 1611 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1576 ConstructedInterpolants, 203 QuantifiedInterpolants, 1045987 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...