./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/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 abd6dbc145d5f477746656086724ee83e0738836 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:23:21,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:23:21,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:23:21,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:23:21,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:23:21,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:23:21,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:23:21,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:23:21,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:23:21,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:23:21,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:23:21,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:23:21,231 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:23:21,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:23:21,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:23:21,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:23:21,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:23:21,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:23:21,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:23:21,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:23:21,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:23:21,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:23:21,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:23:21,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:23:21,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:23:21,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:23:21,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:23:21,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:23:21,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:23:21,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:23:21,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:23:21,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:23:21,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:23:21,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:23:21,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:23:21,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:23:21,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:23:21,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:23:21,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:23:21,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:23:21,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:23:21,247 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 14:23:21,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:23:21,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:23:21,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:23:21,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:23:21,258 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:23:21,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:23:21,258 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:23:21,258 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:23:21,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:23:21,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:23:21,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:23:21,259 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:23:21,259 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:23:21,259 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:23:21,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:23:21,259 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:23:21,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:23:21,259 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:23:21,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:23:21,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:23:21,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:23:21,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:23:21,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:23:21,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:23:21,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:23:21,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:23:21,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:23:21,261 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:23:21,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/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 -> abd6dbc145d5f477746656086724ee83e0738836 [2019-12-07 14:23:21,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:23:21,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:23:21,367 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:23:21,368 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:23:21,368 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:23:21,369 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-12-07 14:23:21,405 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/data/5b3341b69/c3c9db9021ea4a7fb743a85e4005a44a/FLAGeb769c4ab [2019-12-07 14:23:21,790 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:23:21,790 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-12-07 14:23:21,798 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/data/5b3341b69/c3c9db9021ea4a7fb743a85e4005a44a/FLAGeb769c4ab [2019-12-07 14:23:21,807 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/data/5b3341b69/c3c9db9021ea4a7fb743a85e4005a44a [2019-12-07 14:23:21,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:23:21,810 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 14:23:21,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:21,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:23:21,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:23:21,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:21" (1/1) ... [2019-12-07 14:23:21,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e011e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:21, skipping insertion in model container [2019-12-07 14:23:21,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:21" (1/1) ... [2019-12-07 14:23:21,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:23:21,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:23:22,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:22,074 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:23:22,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:22,137 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:23:22,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:22 WrapperNode [2019-12-07 14:23:22,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:22,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:23:22,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:23:22,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:23:22,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:22" (1/1) ... [2019-12-07 14:23:22,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:22" (1/1) ... [2019-12-07 14:23:22,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:22" (1/1) ... [2019-12-07 14:23:22,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:22" (1/1) ... [2019-12-07 14:23:22,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:22" (1/1) ... [2019-12-07 14:23:22,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:22" (1/1) ... [2019-12-07 14:23:22,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:22" (1/1) ... [2019-12-07 14:23:22,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:23:22,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:23:22,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:23:22,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:23:22,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/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 [2019-12-07 14:23:22,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 14:23:22,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:23:22,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 14:23:22,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 14:23:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 14:23:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-12-07 14:23:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-12-07 14:23:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-12-07 14:23:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2019-12-07 14:23:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2019-12-07 14:23:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 14:23:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 14:23:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 14:23:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 14:23:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 14:23:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 14:23:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 14:23:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 14:23:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 14:23:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 14:23:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 14:23:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 14:23:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 14:23:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 14:23:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 14:23:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 14:23:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 14:23:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 14:23:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 14:23:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 14:23:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 14:23:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 14:23:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 14:23:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 14:23:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 14:23:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 14:23:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 14:23:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 14:23:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 14:23:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 14:23:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 14:23:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 14:23:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 14:23:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 14:23:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 14:23:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 14:23:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 14:23:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 14:23:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 14:23:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 14:23:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 14:23:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 14:23:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 14:23:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 14:23:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 14:23:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 14:23:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 14:23:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 14:23:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 14:23:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 14:23:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 14:23:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 14:23:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 14:23:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 14:23:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 14:23:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 14:23:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 14:23:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 14:23:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 14:23:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 14:23:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 14:23:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 14:23:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 14:23:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 14:23:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 14:23:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 14:23:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 14:23:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 14:23:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 14:23:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 14:23:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 14:23:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 14:23:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 14:23:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 14:23:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 14:23:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 14:23:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 14:23:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 14:23:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 14:23:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 14:23:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 14:23:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 14:23:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-12-07 14:23:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:23:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:23:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:23:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-12-07 14:23:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-12-07 14:23:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:23:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:23:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2019-12-07 14:23:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 14:23:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2019-12-07 14:23:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 14:23:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 14:23:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:23:22,404 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 14:23:22,552 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:23:22,552 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 14:23:22,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:22 BoogieIcfgContainer [2019-12-07 14:23:22,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:23:22,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:23:22,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:23:22,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:23:22,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:23:21" (1/3) ... [2019-12-07 14:23:22,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1cbff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:22, skipping insertion in model container [2019-12-07 14:23:22,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:22" (2/3) ... [2019-12-07 14:23:22,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1cbff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:22, skipping insertion in model container [2019-12-07 14:23:22,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:22" (3/3) ... [2019-12-07 14:23:22,559 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2019-12-07 14:23:22,568 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:23:22,575 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-12-07 14:23:22,585 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-12-07 14:23:22,601 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:23:22,601 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:23:22,601 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:23:22,601 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:23:22,601 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:23:22,601 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:23:22,601 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:23:22,601 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:23:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2019-12-07 14:23:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 14:23:22,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:22,620 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:22,621 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash -60425913, now seen corresponding path program 1 times [2019-12-07 14:23:22,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:22,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644453920] [2019-12-07 14:23:22,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:22,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644453920] [2019-12-07 14:23:22,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:22,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:22,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854563062] [2019-12-07 14:23:22,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:22,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:22,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:22,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:22,791 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 4 states. [2019-12-07 14:23:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:22,982 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2019-12-07 14:23:22,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:22,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 14:23:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:22,991 INFO L225 Difference]: With dead ends: 121 [2019-12-07 14:23:22,992 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 14:23:22,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 14:23:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2019-12-07 14:23:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 14:23:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2019-12-07 14:23:23,023 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 12 [2019-12-07 14:23:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:23,024 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2019-12-07 14:23:23,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2019-12-07 14:23:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 14:23:23,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:23,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:23,025 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:23,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:23,025 INFO L82 PathProgramCache]: Analyzing trace with hash -60425912, now seen corresponding path program 1 times [2019-12-07 14:23:23,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:23,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864326701] [2019-12-07 14:23:23,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:23,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864326701] [2019-12-07 14:23:23,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:23,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:23,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398649586] [2019-12-07 14:23:23,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:23,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:23,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:23,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:23,081 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 4 states. [2019-12-07 14:23:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:23,219 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-12-07 14:23:23,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:23,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 14:23:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:23,221 INFO L225 Difference]: With dead ends: 113 [2019-12-07 14:23:23,221 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 14:23:23,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 14:23:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2019-12-07 14:23:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 14:23:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-12-07 14:23:23,229 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 12 [2019-12-07 14:23:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:23,229 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-12-07 14:23:23,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-12-07 14:23:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:23:23,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:23,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:23,231 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:23,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:23,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2117576354, now seen corresponding path program 1 times [2019-12-07 14:23:23,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:23,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136594958] [2019-12-07 14:23:23,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:23,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136594958] [2019-12-07 14:23:23,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:23,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:23:23,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265565057] [2019-12-07 14:23:23,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:23:23,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:23,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:23:23,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:23:23,336 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 8 states. [2019-12-07 14:23:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:23,637 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-12-07 14:23:23,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:23:23,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 14:23:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:23,639 INFO L225 Difference]: With dead ends: 117 [2019-12-07 14:23:23,639 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 14:23:23,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:23:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 14:23:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2019-12-07 14:23:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 14:23:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2019-12-07 14:23:23,648 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 19 [2019-12-07 14:23:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:23,648 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2019-12-07 14:23:23,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:23:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2019-12-07 14:23:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:23:23,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:23,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:23,649 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:23,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2117576353, now seen corresponding path program 1 times [2019-12-07 14:23:23,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:23,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015151349] [2019-12-07 14:23:23,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:23,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015151349] [2019-12-07 14:23:23,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:23,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:23:23,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598066275] [2019-12-07 14:23:23,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:23:23,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:23,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:23:23,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:23,720 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 7 states. [2019-12-07 14:23:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:23,955 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-12-07 14:23:23,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:23:23,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-07 14:23:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:23,957 INFO L225 Difference]: With dead ends: 114 [2019-12-07 14:23:23,957 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 14:23:23,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:23:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 14:23:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2019-12-07 14:23:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 14:23:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2019-12-07 14:23:23,963 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 19 [2019-12-07 14:23:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:23,963 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2019-12-07 14:23:23,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:23:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2019-12-07 14:23:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:23:23,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:23,964 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:23,964 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:23,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash 298301399, now seen corresponding path program 1 times [2019-12-07 14:23:23,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:23,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061369344] [2019-12-07 14:23:23,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:23:24,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061369344] [2019-12-07 14:23:24,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:24,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:23:24,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613949569] [2019-12-07 14:23:24,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:23:24,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:24,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:23:24,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:23:24,032 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 8 states. [2019-12-07 14:23:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:24,276 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2019-12-07 14:23:24,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:23:24,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 14:23:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:24,277 INFO L225 Difference]: With dead ends: 114 [2019-12-07 14:23:24,277 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 14:23:24,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:23:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 14:23:24,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2019-12-07 14:23:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 14:23:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-12-07 14:23:24,283 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 28 [2019-12-07 14:23:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:24,283 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-12-07 14:23:24,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:23:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-12-07 14:23:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:23:24,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:24,284 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:24,284 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash 298301400, now seen corresponding path program 1 times [2019-12-07 14:23:24,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:24,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693519523] [2019-12-07 14:23:24,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:23:24,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693519523] [2019-12-07 14:23:24,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:24,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:23:24,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6726886] [2019-12-07 14:23:24,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:23:24,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:24,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:23:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:23:24,361 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 8 states. [2019-12-07 14:23:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:24,604 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2019-12-07 14:23:24,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:23:24,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-12-07 14:23:24,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:24,605 INFO L225 Difference]: With dead ends: 113 [2019-12-07 14:23:24,605 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 14:23:24,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:23:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 14:23:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2019-12-07 14:23:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 14:23:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2019-12-07 14:23:24,610 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 28 [2019-12-07 14:23:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:24,610 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2019-12-07 14:23:24,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:23:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2019-12-07 14:23:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:23:24,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:24,611 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:23:24,612 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:24,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:24,612 INFO L82 PathProgramCache]: Analyzing trace with hash 409760108, now seen corresponding path program 1 times [2019-12-07 14:23:24,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:24,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426309507] [2019-12-07 14:23:24,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:23:24,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426309507] [2019-12-07 14:23:24,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421753445] [2019-12-07 14:23:24,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:24,801 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 14:23:24,807 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:24,891 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:23:24,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:24,900 INFO L377 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 1 case distinctions, treesize of input 12 treesize of output 23 [2019-12-07 14:23:24,900 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:24,909 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 14:23:24,910 INFO L534 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. [2019-12-07 14:23:24,910 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 14:23:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:23:24,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:23:24,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-12-07 14:23:24,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316530500] [2019-12-07 14:23:24,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:23:24,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:24,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:23:24,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:23:24,917 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 12 states. [2019-12-07 14:23:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:25,393 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-12-07 14:23:25,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:23:25,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-12-07 14:23:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:25,394 INFO L225 Difference]: With dead ends: 127 [2019-12-07 14:23:25,394 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 14:23:25,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:23:25,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 14:23:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2019-12-07 14:23:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 14:23:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-12-07 14:23:25,399 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 31 [2019-12-07 14:23:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:25,399 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-12-07 14:23:25,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:23:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-12-07 14:23:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 14:23:25,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:25,400 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:23:25,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:25,602 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash 409760109, now seen corresponding path program 1 times [2019-12-07 14:23:25,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:25,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714041367] [2019-12-07 14:23:25,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:23:25,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714041367] [2019-12-07 14:23:25,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276989691] [2019-12-07 14:23:25,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:25,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 14:23:25,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:25,826 INFO L377 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 [2019-12-07 14:23:25,826 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:25,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:25,828 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:23:25,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:23:25,928 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:25,928 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 33 [2019-12-07 14:23:25,929 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:25,942 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-12-07 14:23:25,943 INFO L534 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. [2019-12-07 14:23:25,943 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-12-07 14:23:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:23:25,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:23:25,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-07 14:23:25,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096281802] [2019-12-07 14:23:25,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:23:25,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:25,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:23:25,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:23:25,960 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 16 states. [2019-12-07 14:23:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:26,517 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-12-07 14:23:26,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:23:26,517 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-12-07 14:23:26,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:26,518 INFO L225 Difference]: With dead ends: 112 [2019-12-07 14:23:26,518 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 14:23:26,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:23:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 14:23:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-12-07 14:23:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 14:23:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-12-07 14:23:26,523 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 31 [2019-12-07 14:23:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:26,524 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-12-07 14:23:26,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 14:23:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-12-07 14:23:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:23:26,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:26,525 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:23:26,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:26,726 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:26,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:26,726 INFO L82 PathProgramCache]: Analyzing trace with hash -719435029, now seen corresponding path program 1 times [2019-12-07 14:23:26,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:26,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259209887] [2019-12-07 14:23:26,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:23:26,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259209887] [2019-12-07 14:23:26,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:26,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 14:23:26,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259562885] [2019-12-07 14:23:26,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:23:26,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:26,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:23:26,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:23:26,875 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 14 states. [2019-12-07 14:23:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:27,357 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2019-12-07 14:23:27,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:23:27,358 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-12-07 14:23:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:27,358 INFO L225 Difference]: With dead ends: 119 [2019-12-07 14:23:27,359 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 14:23:27,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:23:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 14:23:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2019-12-07 14:23:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 14:23:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-12-07 14:23:27,362 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 40 [2019-12-07 14:23:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:27,363 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-12-07 14:23:27,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:23:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-12-07 14:23:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:23:27,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:27,364 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:23:27,364 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:27,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:27,364 INFO L82 PathProgramCache]: Analyzing trace with hash -719435028, now seen corresponding path program 1 times [2019-12-07 14:23:27,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:27,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435239897] [2019-12-07 14:23:27,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:23:27,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435239897] [2019-12-07 14:23:27,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:27,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 14:23:27,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380534938] [2019-12-07 14:23:27,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:23:27,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:27,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:23:27,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:23:27,518 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 14 states. [2019-12-07 14:23:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:28,848 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-12-07 14:23:28,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 14:23:28,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-12-07 14:23:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:28,850 INFO L225 Difference]: With dead ends: 117 [2019-12-07 14:23:28,850 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 14:23:28,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:23:28,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 14:23:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2019-12-07 14:23:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 14:23:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-12-07 14:23:28,856 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 40 [2019-12-07 14:23:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:28,856 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-12-07 14:23:28,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:23:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-12-07 14:23:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:23:28,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:28,857 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:23:28,858 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:28,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1534557288, now seen corresponding path program 1 times [2019-12-07 14:23:28,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:28,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633785557] [2019-12-07 14:23:28,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:23:28,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633785557] [2019-12-07 14:23:28,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:28,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:23:28,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500382043] [2019-12-07 14:23:28,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:28,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:28,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:28,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:28,919 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 6 states. [2019-12-07 14:23:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:29,117 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-12-07 14:23:29,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:23:29,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 14:23:29,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:29,119 INFO L225 Difference]: With dead ends: 123 [2019-12-07 14:23:29,119 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 14:23:29,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:23:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 14:23:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2019-12-07 14:23:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 14:23:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-12-07 14:23:29,122 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 42 [2019-12-07 14:23:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:29,122 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-12-07 14:23:29,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-12-07 14:23:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:23:29,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:29,123 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:29,123 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:29,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:29,123 INFO L82 PathProgramCache]: Analyzing trace with hash -800451940, now seen corresponding path program 1 times [2019-12-07 14:23:29,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:29,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155412806] [2019-12-07 14:23:29,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:23:29,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155412806] [2019-12-07 14:23:29,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:29,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:23:29,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154642078] [2019-12-07 14:23:29,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:23:29,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:29,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:23:29,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:29,182 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 7 states. [2019-12-07 14:23:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:29,393 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-12-07 14:23:29,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:23:29,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 14:23:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:29,394 INFO L225 Difference]: With dead ends: 128 [2019-12-07 14:23:29,394 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 14:23:29,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:23:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 14:23:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 102. [2019-12-07 14:23:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 14:23:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-12-07 14:23:29,397 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 43 [2019-12-07 14:23:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:29,398 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-12-07 14:23:29,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:23:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-12-07 14:23:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 14:23:29,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:29,398 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:29,399 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash 335398044, now seen corresponding path program 1 times [2019-12-07 14:23:29,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:29,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322124303] [2019-12-07 14:23:29,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:23:29,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322124303] [2019-12-07 14:23:29,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:29,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 14:23:29,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404568103] [2019-12-07 14:23:29,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 14:23:29,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:29,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 14:23:29,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:23:29,541 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 15 states. [2019-12-07 14:23:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:30,061 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-12-07 14:23:30,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:23:30,062 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-12-07 14:23:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:30,063 INFO L225 Difference]: With dead ends: 130 [2019-12-07 14:23:30,063 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 14:23:30,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:23:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 14:23:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2019-12-07 14:23:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 14:23:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2019-12-07 14:23:30,067 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 50 [2019-12-07 14:23:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:30,067 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2019-12-07 14:23:30,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 14:23:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2019-12-07 14:23:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 14:23:30,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:30,068 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:30,068 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:30,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:30,068 INFO L82 PathProgramCache]: Analyzing trace with hash 335398045, now seen corresponding path program 1 times [2019-12-07 14:23:30,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:30,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666164808] [2019-12-07 14:23:30,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:23:30,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666164808] [2019-12-07 14:23:30,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:30,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 14:23:30,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927584047] [2019-12-07 14:23:30,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 14:23:30,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:30,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 14:23:30,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:23:30,242 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 15 states. [2019-12-07 14:23:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:30,798 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-12-07 14:23:30,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:23:30,798 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-12-07 14:23:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:30,799 INFO L225 Difference]: With dead ends: 129 [2019-12-07 14:23:30,799 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 14:23:30,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:23:30,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 14:23:30,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2019-12-07 14:23:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 14:23:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2019-12-07 14:23:30,802 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 50 [2019-12-07 14:23:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:30,803 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2019-12-07 14:23:30,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 14:23:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2019-12-07 14:23:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:23:30,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:30,803 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:30,804 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:23:30,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:30,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1276079784, now seen corresponding path program 1 times [2019-12-07 14:23:30,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:30,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831525533] [2019-12-07 14:23:30,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:23:31,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831525533] [2019-12-07 14:23:31,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349431228] [2019-12-07 14:23:31,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:23:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:31,260 INFO L264 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-07 14:23:31,262 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:23:31,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:31,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:23:31,338 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:31,341 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:31,341 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:23:31,341 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 14:23:31,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:23:31,387 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:31,390 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:31,390 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:23:31,391 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 14:23:31,453 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:31,454 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-12-07 14:23:31,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:23:31,456 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:31,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:31,460 INFO L534 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. [2019-12-07 14:23:31,460 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 14:23:31,630 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:31,630 INFO L377 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 29 treesize of output 28 [2019-12-07 14:23:31,631 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:23:31,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:31,636 INFO L534 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. [2019-12-07 14:23:31,636 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:9 [2019-12-07 14:23:45,087 WARN L192 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 14:23:45,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:23:45,117 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 14:23:45,117 INFO L377 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 2 case distinctions, treesize of input 48 treesize of output 52 [2019-12-07 14:23:45,118 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:45,132 INFO L614 ElimStorePlain]: treesize reduction 14, result has 72.5 percent of original size [2019-12-07 14:23:45,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:23:45,133 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:34 [2019-12-07 14:23:45,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:45,277 INFO L377 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 36 treesize of output 31 [2019-12-07 14:23:45,278 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:23:45,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:23:45,281 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:23:45,281 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-12-07 14:23:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:23:45,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:23:45,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 41 [2019-12-07 14:23:45,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029634225] [2019-12-07 14:23:45,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 14:23:45,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:45,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 14:23:45,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1603, Unknown=17, NotChecked=0, Total=1722 [2019-12-07 14:23:45,289 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 42 states. [2019-12-07 14:24:00,766 WARN L192 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 14:24:06,826 WARN L192 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-07 14:24:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:12,673 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2019-12-07 14:24:12,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 14:24:12,673 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 51 [2019-12-07 14:24:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:12,675 INFO L225 Difference]: With dead ends: 193 [2019-12-07 14:24:12,675 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 14:24:12,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=344, Invalid=3671, Unknown=17, NotChecked=0, Total=4032 [2019-12-07 14:24:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 14:24:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 137. [2019-12-07 14:24:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-07 14:24:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2019-12-07 14:24:12,681 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 51 [2019-12-07 14:24:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:12,681 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2019-12-07 14:24:12,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 14:24:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2019-12-07 14:24:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:24:12,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:12,682 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:12,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:12,883 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:24:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1276079785, now seen corresponding path program 1 times [2019-12-07 14:24:12,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:24:12,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236438316] [2019-12-07 14:24:12,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:24:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:24:13,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236438316] [2019-12-07 14:24:13,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610936295] [2019-12-07 14:24:13,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:24:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:13,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 84 conjunts are in the unsatisfiable core [2019-12-07 14:24:13,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:24:13,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:13,857 INFO L377 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 14 treesize of output 16 [2019-12-07 14:24:13,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:24:13,870 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,876 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,876 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,877 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 14:24:13,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:24:13,973 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,981 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:24:13,984 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:13,993 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:24:13,993 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-12-07 14:24:14,101 INFO L377 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 42 treesize of output 33 [2019-12-07 14:24:14,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:14,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:14,126 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:14,126 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 64 [2019-12-07 14:24:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:24:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:24:14,128 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 14:24:14,154 INFO L614 ElimStorePlain]: treesize reduction 52, result has 54.0 percent of original size [2019-12-07 14:24:14,154 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:14,154 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:61 [2019-12-07 14:24:14,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:14,461 INFO L377 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 46 treesize of output 41 [2019-12-07 14:24:14,462 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:14,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:14,486 INFO L377 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 26 treesize of output 14 [2019-12-07 14:24:14,487 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:14,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:14,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:14,495 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:67, output treesize:21 [2019-12-07 14:24:27,609 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:24:27,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:27,667 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 14:24:27,668 INFO L377 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 2 case distinctions, treesize of input 65 treesize of output 65 [2019-12-07 14:24:27,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:27,719 INFO L614 ElimStorePlain]: treesize reduction 14, result has 87.4 percent of original size [2019-12-07 14:24:27,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:24:27,723 INFO L377 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 53 treesize of output 36 [2019-12-07 14:24:27,723 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:27,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:27,739 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 14:24:27,739 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:116, output treesize:75 [2019-12-07 14:24:28,026 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:28,027 INFO L377 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 53 treesize of output 44 [2019-12-07 14:24:28,027 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:28,037 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:28,039 INFO L377 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 33 treesize of output 17 [2019-12-07 14:24:28,039 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:24:28,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:24:28,046 INFO L534 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. [2019-12-07 14:24:28,046 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:20 [2019-12-07 14:24:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:24:28,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:24:28,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 49 [2019-12-07 14:24:28,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308182722] [2019-12-07 14:24:28,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-07 14:24:28,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:24:28,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-07 14:24:28,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=2328, Unknown=7, NotChecked=0, Total=2450 [2019-12-07 14:24:28,183 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand 50 states. [2019-12-07 14:24:37,944 WARN L192 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-12-07 14:24:38,291 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-12-07 14:25:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:12,027 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2019-12-07 14:25:12,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 14:25:12,028 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 51 [2019-12-07 14:25:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:12,029 INFO L225 Difference]: With dead ends: 283 [2019-12-07 14:25:12,029 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 14:25:12,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=462, Invalid=5992, Unknown=26, NotChecked=0, Total=6480 [2019-12-07 14:25:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 14:25:12,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 151. [2019-12-07 14:25:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 14:25:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2019-12-07 14:25:12,036 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 51 [2019-12-07 14:25:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:12,037 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2019-12-07 14:25:12,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-12-07 14:25:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2019-12-07 14:25:12,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:25:12,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:12,037 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:12,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:12,239 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:25:12,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1750976644, now seen corresponding path program 1 times [2019-12-07 14:25:12,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:12,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073718438] [2019-12-07 14:25:12,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:25:12,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073718438] [2019-12-07 14:25:12,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:12,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:25:12,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306244046] [2019-12-07 14:25:12,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:25:12,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:12,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:25:12,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:25:12,346 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand 8 states. [2019-12-07 14:25:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:12,564 INFO L93 Difference]: Finished difference Result 184 states and 206 transitions. [2019-12-07 14:25:12,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:25:12,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-07 14:25:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:12,565 INFO L225 Difference]: With dead ends: 184 [2019-12-07 14:25:12,565 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 14:25:12,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:25:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 14:25:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 158. [2019-12-07 14:25:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 14:25:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 179 transitions. [2019-12-07 14:25:12,569 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 179 transitions. Word has length 53 [2019-12-07 14:25:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:12,569 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 179 transitions. [2019-12-07 14:25:12,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:25:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 179 transitions. [2019-12-07 14:25:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:25:12,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:12,570 INFO L410 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] [2019-12-07 14:25:12,570 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:25:12,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:12,570 INFO L82 PathProgramCache]: Analyzing trace with hash 938998207, now seen corresponding path program 2 times [2019-12-07 14:25:12,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:12,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145320107] [2019-12-07 14:25:12,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:25:12,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145320107] [2019-12-07 14:25:12,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145489133] [2019-12-07 14:25:12,644 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:12,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:25:12,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:25:12,722 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:25:12,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:25:12,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:25:12,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-12-07 14:25:12,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981945067] [2019-12-07 14:25:12,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:25:12,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:12,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:25:12,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:25:12,730 INFO L87 Difference]: Start difference. First operand 158 states and 179 transitions. Second operand 10 states. [2019-12-07 14:25:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:13,001 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2019-12-07 14:25:13,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:25:13,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-07 14:25:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:13,002 INFO L225 Difference]: With dead ends: 173 [2019-12-07 14:25:13,003 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 14:25:13,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:25:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 14:25:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 152. [2019-12-07 14:25:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 14:25:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2019-12-07 14:25:13,006 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 54 [2019-12-07 14:25:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:13,007 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2019-12-07 14:25:13,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:25:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2019-12-07 14:25:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:25:13,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:13,007 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:13,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:13,209 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:25:13,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:13,209 INFO L82 PathProgramCache]: Analyzing trace with hash -386868548, now seen corresponding path program 1 times [2019-12-07 14:25:13,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:13,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92244059] [2019-12-07 14:25:13,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:25:13,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92244059] [2019-12-07 14:25:13,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531265039] [2019-12-07 14:25:13,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,378 INFO L264 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:25:13,380 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:25:13,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:25:13,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-12-07 14:25:13,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537965276] [2019-12-07 14:25:13,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:25:13,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:13,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:25:13,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:25:13,400 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand 10 states. [2019-12-07 14:25:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:13,604 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2019-12-07 14:25:13,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:25:13,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 14:25:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:13,605 INFO L225 Difference]: With dead ends: 192 [2019-12-07 14:25:13,605 INFO L226 Difference]: Without dead ends: 192 [2019-12-07 14:25:13,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:25:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-07 14:25:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 160. [2019-12-07 14:25:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-12-07 14:25:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-12-07 14:25:13,610 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 56 [2019-12-07 14:25:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:13,610 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-12-07 14:25:13,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:25:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-12-07 14:25:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:25:13,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:13,611 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-12-07 14:25:13,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:13,811 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:25:13,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:13,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1136557365, now seen corresponding path program 3 times [2019-12-07 14:25:13,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:13,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285092152] [2019-12-07 14:25:13,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 14:25:13,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285092152] [2019-12-07 14:25:13,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294696678] [2019-12-07 14:25:13,902 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:14,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 14:25:14,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:25:14,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:25:14,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:25:14,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:25:14,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-12-07 14:25:14,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569412720] [2019-12-07 14:25:14,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 14:25:14,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:14,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 14:25:14,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:25:14,080 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 17 states. [2019-12-07 14:25:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:14,624 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2019-12-07 14:25:14,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:25:14,624 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2019-12-07 14:25:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:14,625 INFO L225 Difference]: With dead ends: 174 [2019-12-07 14:25:14,625 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 14:25:14,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:25:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 14:25:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 152. [2019-12-07 14:25:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 14:25:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2019-12-07 14:25:14,629 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 62 [2019-12-07 14:25:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:14,629 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2019-12-07 14:25:14,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 14:25:14,629 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2019-12-07 14:25:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 14:25:14,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:14,630 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:25:14,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:14,831 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:25:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1847578294, now seen corresponding path program 4 times [2019-12-07 14:25:14,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:14,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643394092] [2019-12-07 14:25:14,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 14:25:14,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643394092] [2019-12-07 14:25:14,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16405472] [2019-12-07 14:25:14,919 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:15,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:25:15,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:25:15,006 INFO L264 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:25:15,007 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 14:25:15,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:25:15,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-12-07 14:25:15,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762603200] [2019-12-07 14:25:15,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:25:15,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:15,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:25:15,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:25:15,022 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 10 states. [2019-12-07 14:25:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:15,384 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2019-12-07 14:25:15,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:25:15,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-12-07 14:25:15,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:15,389 INFO L225 Difference]: With dead ends: 145 [2019-12-07 14:25:15,389 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 14:25:15,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:25:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 14:25:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 117. [2019-12-07 14:25:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 14:25:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2019-12-07 14:25:15,404 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 63 [2019-12-07 14:25:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:15,404 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2019-12-07 14:25:15,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:25:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2019-12-07 14:25:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 14:25:15,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:15,407 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:15,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:15,608 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:25:15,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1071222224, now seen corresponding path program 2 times [2019-12-07 14:25:15,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:15,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187114436] [2019-12-07 14:25:15,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:25:15,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187114436] [2019-12-07 14:25:15,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856150152] [2019-12-07 14:25:15,703 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:15,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:25:15,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:25:15,783 INFO L264 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:25:15,784 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:25:15,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:25:15,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-12-07 14:25:15,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254955087] [2019-12-07 14:25:15,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:15,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:15,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:15,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:25:15,817 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 6 states. [2019-12-07 14:25:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:15,852 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2019-12-07 14:25:15,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:15,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-07 14:25:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:15,853 INFO L225 Difference]: With dead ends: 117 [2019-12-07 14:25:15,853 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 14:25:15,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:25:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 14:25:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-12-07 14:25:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 14:25:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2019-12-07 14:25:15,855 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 64 [2019-12-07 14:25:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:15,856 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2019-12-07 14:25:15,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2019-12-07 14:25:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:25:15,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:15,856 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:16,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:16,058 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:25:16,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash 614786169, now seen corresponding path program 1 times [2019-12-07 14:25:16,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:16,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671703676] [2019-12-07 14:25:16,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:25:16,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671703676] [2019-12-07 14:25:16,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479775108] [2019-12-07 14:25:16,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:16,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 100 conjunts are in the unsatisfiable core [2019-12-07 14:25:16,996 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:17,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:17,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:25:17,143 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:17,146 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:17,146 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:17,146 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 14:25:17,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:25:17,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:17,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:17,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:17,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 14:25:17,301 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:17,301 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2019-12-07 14:25:17,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:17,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:17,302 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:25:17,311 INFO L614 ElimStorePlain]: treesize reduction 25, result has 44.4 percent of original size [2019-12-07 14:25:17,312 INFO L534 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. [2019-12-07 14:25:17,312 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-12-07 14:25:17,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 14:25:17,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:17,785 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:17,785 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:17,785 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 14:25:17,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:17,866 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 14:25:17,867 INFO L377 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 2 case distinctions, treesize of input 39 treesize of output 47 [2019-12-07 14:25:17,867 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:17,879 INFO L614 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-12-07 14:25:17,879 INFO L534 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. [2019-12-07 14:25:17,879 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:32 [2019-12-07 14:25:18,854 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int) (sll_circular_update_at_~data Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ sll_circular_update_at_~head.offset 4) sll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2019-12-07 14:25:18,859 INFO L377 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 31 treesize of output 26 [2019-12-07 14:25:18,860 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:18,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:18,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:18,872 INFO L377 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 33 treesize of output 32 [2019-12-07 14:25:18,873 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:18,878 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:18,878 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:18,878 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:53, output treesize:13 [2019-12-07 14:25:19,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:19,258 INFO L377 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 37 treesize of output 29 [2019-12-07 14:25:19,258 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:19,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:19,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:19,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:7 [2019-12-07 14:25:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-12-07 14:25:19,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:25:19,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 67 [2019-12-07 14:25:19,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235956921] [2019-12-07 14:25:19,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-12-07 14:25:19,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:19,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-12-07 14:25:19,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=4097, Unknown=1, NotChecked=128, Total=4422 [2019-12-07 14:25:19,317 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 67 states. [2019-12-07 14:25:28,036 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-07 14:25:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:31,718 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2019-12-07 14:25:31,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 14:25:31,718 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-12-07 14:25:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:31,719 INFO L225 Difference]: With dead ends: 135 [2019-12-07 14:25:31,719 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 14:25:31,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1787 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=552, Invalid=9143, Unknown=11, NotChecked=194, Total=9900 [2019-12-07 14:25:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 14:25:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 112. [2019-12-07 14:25:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 14:25:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2019-12-07 14:25:31,726 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 67 [2019-12-07 14:25:31,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:31,726 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2019-12-07 14:25:31,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-12-07 14:25:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2019-12-07 14:25:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:25:31,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:31,728 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:31,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:31,928 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:25:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash 635708019, now seen corresponding path program 1 times [2019-12-07 14:25:31,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:31,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490466446] [2019-12-07 14:25:31,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:25:32,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490466446] [2019-12-07 14:25:32,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935883873] [2019-12-07 14:25:32,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:32,560 INFO L264 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 79 conjunts are in the unsatisfiable core [2019-12-07 14:25:32,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:32,646 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:32,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:25:32,647 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:32,649 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:32,649 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:32,649 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 14:25:32,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:25:32,702 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:32,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:32,705 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:32,705 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 14:25:32,772 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:32,772 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2019-12-07 14:25:32,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:32,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:32,773 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:25:32,782 INFO L614 ElimStorePlain]: treesize reduction 25, result has 44.4 percent of original size [2019-12-07 14:25:32,782 INFO L534 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. [2019-12-07 14:25:32,782 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-12-07 14:25:33,615 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-12-07 14:25:33,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:33,641 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 14:25:33,642 INFO L377 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 2 case distinctions, treesize of input 39 treesize of output 47 [2019-12-07 14:25:33,642 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:33,656 INFO L614 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2019-12-07 14:25:33,656 INFO L534 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. [2019-12-07 14:25:33,656 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2019-12-07 14:25:34,885 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 14:25:34,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:34,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 117 [2019-12-07 14:25:34,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:34,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:34,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:34,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:34,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:34,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:34,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:34,916 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 14:25:34,948 INFO L614 ElimStorePlain]: treesize reduction 230, result has 18.7 percent of original size [2019-12-07 14:25:34,949 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:25:34,949 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:48 [2019-12-07 14:25:35,102 INFO L377 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 13 [2019-12-07 14:25:35,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:35,105 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:35,105 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:35,105 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-12-07 14:25:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2019-12-07 14:25:35,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:25:35,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 48 [2019-12-07 14:25:35,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527992745] [2019-12-07 14:25:35,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 14:25:35,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:35,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 14:25:35,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2127, Unknown=1, NotChecked=92, Total=2352 [2019-12-07 14:25:35,119 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 49 states. [2019-12-07 14:25:36,552 WARN L192 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-07 14:25:37,159 WARN L192 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-12-07 14:25:40,044 WARN L192 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-12-07 14:25:40,720 WARN L192 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-12-07 14:25:41,330 WARN L192 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-12-07 14:25:42,191 WARN L192 SmtUtils]: Spent 785.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 14:25:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:43,364 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2019-12-07 14:25:43,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 14:25:43,364 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 75 [2019-12-07 14:25:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:43,365 INFO L225 Difference]: With dead ends: 143 [2019-12-07 14:25:43,365 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 14:25:43,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=387, Invalid=4446, Unknown=1, NotChecked=136, Total=4970 [2019-12-07 14:25:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 14:25:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 116. [2019-12-07 14:25:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 14:25:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2019-12-07 14:25:43,369 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 75 [2019-12-07 14:25:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:43,369 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2019-12-07 14:25:43,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 14:25:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2019-12-07 14:25:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:25:43,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:43,370 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:43,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:43,571 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:25:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:43,571 INFO L82 PathProgramCache]: Analyzing trace with hash 635708020, now seen corresponding path program 1 times [2019-12-07 14:25:43,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:43,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573464740] [2019-12-07 14:25:43,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:25:44,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573464740] [2019-12-07 14:25:44,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319209728] [2019-12-07 14:25:44,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:44,419 INFO L264 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 99 conjunts are in the unsatisfiable core [2019-12-07 14:25:44,420 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:44,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:25:44,688 INFO L377 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 14 treesize of output 16 [2019-12-07 14:25:44,689 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:44,696 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:44,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:44,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:25:44,702 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:44,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:44,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:44,707 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-12-07 14:25:44,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:25:44,796 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:44,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:44,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:25:44,805 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:44,811 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:44,812 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:25:44,812 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2019-12-07 14:25:44,914 INFO L377 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 35 treesize of output 30 [2019-12-07 14:25:44,914 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:44,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:44,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:44,934 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 64 [2019-12-07 14:25:44,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:25:44,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:25:44,935 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 14:25:44,963 INFO L614 ElimStorePlain]: treesize reduction 52, result has 49.5 percent of original size [2019-12-07 14:25:44,963 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:44,964 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2019-12-07 14:25:45,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:45,260 INFO L377 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 46 treesize of output 41 [2019-12-07 14:25:45,261 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:25:45,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:45,271 INFO L377 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 19 treesize of output 11 [2019-12-07 14:25:45,271 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:25:45,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:25:45,276 INFO L534 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. [2019-12-07 14:25:45,276 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:12 [2019-12-07 14:26:11,785 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 14:26:11,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:11,814 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 14:26:11,814 INFO L377 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 2 case distinctions, treesize of input 65 treesize of output 65 [2019-12-07 14:26:11,814 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:11,843 INFO L614 ElimStorePlain]: treesize reduction 14, result has 84.8 percent of original size [2019-12-07 14:26:11,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:11,846 INFO L377 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 46 treesize of output 33 [2019-12-07 14:26:11,846 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:11,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:11,856 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:11,856 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:97, output treesize:56 [2019-12-07 14:26:11,942 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:11,943 INFO L377 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 46 treesize of output 41 [2019-12-07 14:26:11,943 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:11,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:11,954 INFO L377 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 19 treesize of output 11 [2019-12-07 14:26:11,955 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:11,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:11,961 INFO L534 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. [2019-12-07 14:26:11,961 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:12 [2019-12-07 14:26:12,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:12,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 149 [2019-12-07 14:26:12,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:12,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-07 14:26:12,507 INFO L614 ElimStorePlain]: treesize reduction 506, result has 25.4 percent of original size [2019-12-07 14:26:12,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:12,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 210 [2019-12-07 14:26:12,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:12,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:12,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:12,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:12,540 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2019-12-07 14:26:12,660 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 40 [2019-12-07 14:26:12,661 INFO L614 ElimStorePlain]: treesize reduction 1658, result has 6.0 percent of original size [2019-12-07 14:26:12,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:12,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:12,662 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:130, output treesize:100 [2019-12-07 14:26:13,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-12-07 14:26:13,080 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:13,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:13,088 INFO L377 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 28 treesize of output 16 [2019-12-07 14:26:13,088 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:13,095 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:13,096 INFO L534 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. [2019-12-07 14:26:13,096 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:22 [2019-12-07 14:26:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:26:13,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:26:13,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2019-12-07 14:26:13,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495227317] [2019-12-07 14:26:13,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-12-07 14:26:13,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:13,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-12-07 14:26:13,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3469, Unknown=18, NotChecked=0, Total=3660 [2019-12-07 14:26:13,262 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 61 states. [2019-12-07 14:26:15,845 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2019-12-07 14:26:16,701 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-12-07 14:26:18,169 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 14:26:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:20,971 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2019-12-07 14:26:20,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 14:26:20,972 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 75 [2019-12-07 14:26:20,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:20,972 INFO L225 Difference]: With dead ends: 143 [2019-12-07 14:26:20,972 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 14:26:20,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=548, Invalid=7266, Unknown=18, NotChecked=0, Total=7832 [2019-12-07 14:26:20,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 14:26:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 115. [2019-12-07 14:26:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 14:26:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2019-12-07 14:26:20,977 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 75 [2019-12-07 14:26:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:20,977 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2019-12-07 14:26:20,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-12-07 14:26:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2019-12-07 14:26:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 14:26:20,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:20,978 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:21,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:21,179 INFO L410 AbstractCegarLoop]: === Iteration 26 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:26:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash 512525933, now seen corresponding path program 1 times [2019-12-07 14:26:21,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:21,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514846740] [2019-12-07 14:26:21,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:26:21,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514846740] [2019-12-07 14:26:21,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597249832] [2019-12-07 14:26:21,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,344 INFO L264 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:26:21,345 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:26:21,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:26:21,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2019-12-07 14:26:21,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140144331] [2019-12-07 14:26:21,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:26:21,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:21,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:26:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:26:21,367 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 6 states. [2019-12-07 14:26:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:21,409 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2019-12-07 14:26:21,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:26:21,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-12-07 14:26:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:21,411 INFO L225 Difference]: With dead ends: 119 [2019-12-07 14:26:21,411 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 14:26:21,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:26:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 14:26:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-12-07 14:26:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 14:26:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2019-12-07 14:26:21,414 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 78 [2019-12-07 14:26:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:21,414 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2019-12-07 14:26:21,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:26:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2019-12-07 14:26:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 14:26:21,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:21,415 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:21,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:21,616 INFO L410 AbstractCegarLoop]: === Iteration 27 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:26:21,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:21,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1868564301, now seen corresponding path program 2 times [2019-12-07 14:26:21,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:21,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905337040] [2019-12-07 14:26:21,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:26:21,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905337040] [2019-12-07 14:26:21,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198606769] [2019-12-07 14:26:21,698 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:21,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:26:21,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:26:21,789 INFO L264 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:26:21,790 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:26:21,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:26:21,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-12-07 14:26:21,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052812089] [2019-12-07 14:26:21,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:26:21,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:21,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:26:21,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:26:21,798 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 10 states. [2019-12-07 14:26:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:22,073 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-12-07 14:26:22,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:26:22,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-12-07 14:26:22,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:22,074 INFO L225 Difference]: With dead ends: 125 [2019-12-07 14:26:22,074 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 14:26:22,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:26:22,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 14:26:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2019-12-07 14:26:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 14:26:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2019-12-07 14:26:22,077 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 78 [2019-12-07 14:26:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:22,077 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2019-12-07 14:26:22,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:26:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2019-12-07 14:26:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 14:26:22,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:22,078 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:22,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:22,279 INFO L410 AbstractCegarLoop]: === Iteration 28 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:26:22,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2026292397, now seen corresponding path program 1 times [2019-12-07 14:26:22,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:22,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418276137] [2019-12-07 14:26:22,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:26:23,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418276137] [2019-12-07 14:26:23,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062417833] [2019-12-07 14:26:23,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:23,721 INFO L264 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 120 conjunts are in the unsatisfiable core [2019-12-07 14:26:23,723 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:23,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:23,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:26:23,979 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:23,981 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:23,981 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:23,982 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 14:26:24,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:26:24,053 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:24,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:24,056 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:24,056 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 14:26:24,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:24,142 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2019-12-07 14:26:24,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:24,142 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:24,145 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:24,145 INFO L534 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. [2019-12-07 14:26:24,146 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-12-07 14:26:24,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 1 [2019-12-07 14:26:24,441 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:24,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:24,445 INFO L534 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. [2019-12-07 14:26:24,445 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-12-07 14:26:25,261 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-12-07 14:26:25,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:25,287 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 14:26:25,287 INFO L377 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 2 case distinctions, treesize of input 39 treesize of output 47 [2019-12-07 14:26:25,288 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:25,301 INFO L614 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-12-07 14:26:25,301 INFO L534 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. [2019-12-07 14:26:25,302 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:26 [2019-12-07 14:26:25,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 [2019-12-07 14:26:25,538 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:25,545 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:25,545 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:25,545 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2019-12-07 14:26:25,633 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_BEFORE_CALL_8|], 6=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_65|]} [2019-12-07 14:26:25,635 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2019-12-07 14:26:25,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:25,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:25,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:25,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 159 [2019-12-07 14:26:25,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:25,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:25,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:25,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:25,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:25,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:25,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:25,674 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 14:26:25,722 INFO L614 ElimStorePlain]: treesize reduction 298, result has 21.4 percent of original size [2019-12-07 14:26:25,722 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:25,722 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:72 [2019-12-07 14:26:26,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:26,702 INFO L377 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 85 treesize of output 73 [2019-12-07 14:26:26,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:26,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:26,704 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:26,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:26,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:26,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 53 treesize of output 49 [2019-12-07 14:26:26,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:26,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:26,724 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:26,740 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:26,747 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:26,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 37 treesize of output 29 [2019-12-07 14:26:26,748 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:26,774 INFO L614 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-12-07 14:26:26,775 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:26,775 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:85, output treesize:7 [2019-12-07 14:26:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2019-12-07 14:26:26,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:26:26,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 75 [2019-12-07 14:26:26,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817432418] [2019-12-07 14:26:26,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-12-07 14:26:26,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:26,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-12-07 14:26:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=5177, Unknown=1, NotChecked=144, Total=5550 [2019-12-07 14:26:26,849 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand 75 states. [2019-12-07 14:26:29,939 WARN L192 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 14:26:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:32,799 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2019-12-07 14:26:32,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 14:26:32,799 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 81 [2019-12-07 14:26:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:32,800 INFO L225 Difference]: With dead ends: 123 [2019-12-07 14:26:32,800 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 14:26:32,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2496 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=588, Invalid=10335, Unknown=1, NotChecked=206, Total=11130 [2019-12-07 14:26:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 14:26:32,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2019-12-07 14:26:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 14:26:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2019-12-07 14:26:32,803 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 81 [2019-12-07 14:26:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:32,803 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2019-12-07 14:26:32,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-12-07 14:26:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2019-12-07 14:26:32,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:26:32,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:32,804 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:33,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:33,005 INFO L410 AbstractCegarLoop]: === Iteration 29 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:26:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:33,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1300112413, now seen corresponding path program 1 times [2019-12-07 14:26:33,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:33,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943790861] [2019-12-07 14:26:33,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 14:26:33,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943790861] [2019-12-07 14:26:33,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:33,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 14:26:33,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278083579] [2019-12-07 14:26:33,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 14:26:33,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:33,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 14:26:33,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:26:33,213 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 15 states. [2019-12-07 14:26:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:33,740 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-12-07 14:26:33,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:26:33,740 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-12-07 14:26:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:33,741 INFO L225 Difference]: With dead ends: 120 [2019-12-07 14:26:33,741 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 14:26:33,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:26:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 14:26:33,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2019-12-07 14:26:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 14:26:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2019-12-07 14:26:33,743 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 86 [2019-12-07 14:26:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:33,744 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2019-12-07 14:26:33,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 14:26:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2019-12-07 14:26:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 14:26:33,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:33,744 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:33,744 INFO L410 AbstractCegarLoop]: === Iteration 30 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:26:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:33,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1300112414, now seen corresponding path program 1 times [2019-12-07 14:26:33,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:33,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179584245] [2019-12-07 14:26:33,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 14:26:33,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179584245] [2019-12-07 14:26:33,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024129031] [2019-12-07 14:26:33,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,917 INFO L264 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 14:26:33,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 14:26:34,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:26:34,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 17 [2019-12-07 14:26:34,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339501940] [2019-12-07 14:26:34,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:26:34,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:34,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:26:34,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:26:34,072 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 13 states. [2019-12-07 14:26:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:34,295 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2019-12-07 14:26:34,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:26:34,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-12-07 14:26:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:34,296 INFO L225 Difference]: With dead ends: 122 [2019-12-07 14:26:34,296 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 14:26:34,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:26:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 14:26:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2019-12-07 14:26:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 14:26:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2019-12-07 14:26:34,298 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 86 [2019-12-07 14:26:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:34,298 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2019-12-07 14:26:34,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:26:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2019-12-07 14:26:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 14:26:34,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:34,299 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:34,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:34,500 INFO L410 AbstractCegarLoop]: === Iteration 31 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:26:34,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash 366216674, now seen corresponding path program 1 times [2019-12-07 14:26:34,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:34,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989654219] [2019-12-07 14:26:34,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 14:26:34,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989654219] [2019-12-07 14:26:34,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361551164] [2019-12-07 14:26:34,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:34,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 14:26:34,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:34,741 INFO L377 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 9 [2019-12-07 14:26:34,741 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:34,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:34,742 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:34,742 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-12-07 14:26:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 14:26:34,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:26:34,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 13 [2019-12-07 14:26:34,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365803505] [2019-12-07 14:26:34,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:26:34,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:34,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:26:34,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:26:34,748 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 14 states. [2019-12-07 14:26:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:35,323 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-12-07 14:26:35,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 14:26:35,323 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-12-07 14:26:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:35,324 INFO L225 Difference]: With dead ends: 125 [2019-12-07 14:26:35,324 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 14:26:35,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:26:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 14:26:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2019-12-07 14:26:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 14:26:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-12-07 14:26:35,327 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 89 [2019-12-07 14:26:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:35,327 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-12-07 14:26:35,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:26:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-12-07 14:26:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 14:26:35,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:35,328 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:35,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:35,529 INFO L410 AbstractCegarLoop]: === Iteration 32 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:26:35,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:35,530 INFO L82 PathProgramCache]: Analyzing trace with hash 366216675, now seen corresponding path program 1 times [2019-12-07 14:26:35,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:35,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155026346] [2019-12-07 14:26:35,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:26:36,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155026346] [2019-12-07 14:26:36,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829347116] [2019-12-07 14:26:36,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:36,395 INFO L264 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 122 conjunts are in the unsatisfiable core [2019-12-07 14:26:36,397 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:36,532 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:26:36,533 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,537 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,537 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,537 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 14:26:36,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:26:36,540 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:26:36,547 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,552 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,552 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-12-07 14:26:36,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,601 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 57 [2019-12-07 14:26:36,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:36,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:36,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:26:36,622 INFO L614 ElimStorePlain]: treesize reduction 45, result has 52.1 percent of original size [2019-12-07 14:26:36,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-12-07 14:26:36,625 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:36,631 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:36,631 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:36,631 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2019-12-07 14:26:38,134 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-12-07 14:26:38,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:38,163 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 14:26:38,163 INFO L377 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 2 case distinctions, treesize of input 50 treesize of output 54 [2019-12-07 14:26:38,163 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:38,186 INFO L614 ElimStorePlain]: treesize reduction 14, result has 81.8 percent of original size [2019-12-07 14:26:38,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:38,189 INFO L377 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 38 treesize of output 25 [2019-12-07 14:26:38,190 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:38,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:38,198 INFO L534 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. [2019-12-07 14:26:38,198 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:41 [2019-12-07 14:26:39,465 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) |c_#memory_$Pointer$.offset|)) is different from true [2019-12-07 14:26:39,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:39,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 49 [2019-12-07 14:26:39,474 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:26:39,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:39,491 INFO L343 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2019-12-07 14:26:39,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2019-12-07 14:26:39,491 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:39,498 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:39,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:39,499 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:39,499 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:11 [2019-12-07 14:26:39,991 INFO L377 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 23 treesize of output 15 [2019-12-07 14:26:39,991 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:39,995 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:39,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-12-07 14:26:39,996 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:39,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:39,999 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:40,000 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2019-12-07 14:26:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-12-07 14:26:40,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:26:40,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 61 [2019-12-07 14:26:40,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904083299] [2019-12-07 14:26:40,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-12-07 14:26:40,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-12-07 14:26:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3344, Unknown=2, NotChecked=234, Total=3782 [2019-12-07 14:26:40,100 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 62 states. [2019-12-07 14:26:43,363 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-07 14:26:46,787 WARN L192 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2019-12-07 14:26:49,043 WARN L192 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-12-07 14:26:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:50,789 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-12-07 14:26:50,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 14:26:50,790 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 89 [2019-12-07 14:26:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:50,790 INFO L225 Difference]: With dead ends: 125 [2019-12-07 14:26:50,790 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 14:26:50,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1903 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=622, Invalid=7756, Unknown=2, NotChecked=362, Total=8742 [2019-12-07 14:26:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 14:26:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2019-12-07 14:26:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 14:26:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2019-12-07 14:26:50,793 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 89 [2019-12-07 14:26:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:50,793 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2019-12-07 14:26:50,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-12-07 14:26:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2019-12-07 14:26:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 14:26:50,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:50,794 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:50,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:50,995 INFO L410 AbstractCegarLoop]: === Iteration 33 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:26:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:50,996 INFO L82 PathProgramCache]: Analyzing trace with hash 398749026, now seen corresponding path program 1 times [2019-12-07 14:26:50,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:50,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985338003] [2019-12-07 14:26:50,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 14:26:51,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985338003] [2019-12-07 14:26:51,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:51,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 14:26:51,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375992775] [2019-12-07 14:26:51,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:26:51,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:51,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:26:51,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:26:51,131 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 16 states. [2019-12-07 14:26:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:51,469 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2019-12-07 14:26:51,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:26:51,469 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-12-07 14:26:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:51,470 INFO L225 Difference]: With dead ends: 113 [2019-12-07 14:26:51,470 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 14:26:51,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-12-07 14:26:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 14:26:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2019-12-07 14:26:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 14:26:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-12-07 14:26:51,472 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 89 [2019-12-07 14:26:51,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:51,473 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-12-07 14:26:51,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 14:26:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-12-07 14:26:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 14:26:51,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:51,473 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:51,473 INFO L410 AbstractCegarLoop]: === Iteration 34 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:26:51,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:51,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1532186391, now seen corresponding path program 1 times [2019-12-07 14:26:51,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:51,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220617035] [2019-12-07 14:26:51,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 14:26:51,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220617035] [2019-12-07 14:26:51,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:51,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 14:26:51,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135565169] [2019-12-07 14:26:51,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 14:26:51,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:51,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 14:26:51,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:26:51,610 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 15 states. [2019-12-07 14:26:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:52,132 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-12-07 14:26:52,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:26:52,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-12-07 14:26:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:52,132 INFO L225 Difference]: With dead ends: 109 [2019-12-07 14:26:52,132 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 14:26:52,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:26:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 14:26:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-12-07 14:26:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 14:26:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2019-12-07 14:26:52,135 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 90 [2019-12-07 14:26:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:52,135 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2019-12-07 14:26:52,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 14:26:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2019-12-07 14:26:52,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 14:26:52,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:52,136 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:52,137 INFO L410 AbstractCegarLoop]: === Iteration 35 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:26:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:52,137 INFO L82 PathProgramCache]: Analyzing trace with hash 744082798, now seen corresponding path program 1 times [2019-12-07 14:26:52,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:52,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646880870] [2019-12-07 14:26:52,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 14:26:52,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646880870] [2019-12-07 14:26:52,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231807508] [2019-12-07 14:26:52,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:52,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 89 conjunts are in the unsatisfiable core [2019-12-07 14:26:52,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:52,827 INFO L377 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 [2019-12-07 14:26:52,827 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:52,830 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:52,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:52,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-12-07 14:26:52,905 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:52,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:26:52,905 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:52,909 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:52,909 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:52,909 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 14:26:52,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:26:52,969 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:52,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:52,973 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:52,973 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 14:26:53,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:53,209 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-12-07 14:26:53,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:53,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:53,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:26:53,260 INFO L614 ElimStorePlain]: treesize reduction 34, result has 46.0 percent of original size [2019-12-07 14:26:53,260 INFO L534 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. [2019-12-07 14:26:53,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 14:26:53,937 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:53,937 INFO L377 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 29 treesize of output 28 [2019-12-07 14:26:53,938 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:53,939 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:53,940 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:53,940 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2019-12-07 14:26:54,838 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-12-07 14:26:54,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:26:54,864 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 14:26:54,864 INFO L377 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 2 case distinctions, treesize of input 48 treesize of output 52 [2019-12-07 14:26:54,865 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:54,877 INFO L614 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-12-07 14:26:54,877 INFO L534 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. [2019-12-07 14:26:54,877 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-12-07 14:26:54,883 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:54,883 INFO L377 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 29 treesize of output 28 [2019-12-07 14:26:54,884 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:26:54,885 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:54,885 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:54,885 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2019-12-07 14:26:56,161 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))) |c_#memory_$Pointer$.base|)) is different from true [2019-12-07 14:26:56,191 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:56,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 117 [2019-12-07 14:26:56,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:56,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:26:56,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:56,196 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 6 xjuncts. [2019-12-07 14:26:56,247 INFO L614 ElimStorePlain]: treesize reduction 478, result has 10.0 percent of original size [2019-12-07 14:26:56,247 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:26:56,247 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:48 [2019-12-07 14:26:56,547 INFO L377 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 13 [2019-12-07 14:26:56,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:26:56,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:26:56,555 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:26:56,555 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-12-07 14:26:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2019-12-07 14:26:56,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:26:56,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 52 [2019-12-07 14:26:56,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839249482] [2019-12-07 14:26:56,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-12-07 14:26:56,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:56,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-12-07 14:26:56,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2396, Unknown=2, NotChecked=198, Total=2756 [2019-12-07 14:26:56,578 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand 53 states. [2019-12-07 14:26:57,625 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-12-07 14:27:00,391 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-07 14:27:03,147 WARN L192 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 14:27:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:04,553 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2019-12-07 14:27:04,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 14:27:04,553 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 92 [2019-12-07 14:27:04,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:04,554 INFO L225 Difference]: With dead ends: 110 [2019-12-07 14:27:04,554 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 14:27:04,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=467, Invalid=5391, Unknown=2, NotChecked=302, Total=6162 [2019-12-07 14:27:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 14:27:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-12-07 14:27:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 14:27:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2019-12-07 14:27:04,556 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 92 [2019-12-07 14:27:04,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:04,557 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2019-12-07 14:27:04,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-12-07 14:27:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2019-12-07 14:27:04,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 14:27:04,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:04,557 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:27:04,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:27:04,758 INFO L410 AbstractCegarLoop]: === Iteration 36 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:27:04,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:04,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1378764790, now seen corresponding path program 1 times [2019-12-07 14:27:04,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:27:04,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552872295] [2019-12-07 14:27:04,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 14:27:05,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552872295] [2019-12-07 14:27:05,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052446976] [2019-12-07 14:27:05,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:27:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:05,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 95 conjunts are in the unsatisfiable core [2019-12-07 14:27:05,415 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:27:05,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:27:05,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:27:05,482 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:27:05,485 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:27:05,485 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:27:05,485 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-12-07 14:27:05,537 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:27:05,537 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:27:05,541 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:27:05,541 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:27:05,541 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 14:27:05,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:27:05,607 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2019-12-07 14:27:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:27:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:05,608 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:27:05,619 INFO L614 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2019-12-07 14:27:05,620 INFO L534 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. [2019-12-07 14:27:05,620 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-12-07 14:27:06,876 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-12-07 14:27:06,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:27:06,901 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 14:27:06,902 INFO L377 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 2 case distinctions, treesize of input 39 treesize of output 47 [2019-12-07 14:27:06,902 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:27:06,913 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-12-07 14:27:06,913 INFO L534 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. [2019-12-07 14:27:06,913 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:23 [2019-12-07 14:27:08,437 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))) |c_#memory_$Pointer$.base|)) is different from true [2019-12-07 14:27:08,491 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:27:08,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 179 [2019-12-07 14:27:08,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:27:08,492 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:27:08,508 INFO L614 ElimStorePlain]: treesize reduction 117, result has 19.9 percent of original size [2019-12-07 14:27:08,509 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:27:08,509 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:12 [2019-12-07 14:27:10,513 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_38 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_38 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_38) 0)))) is different from true [2019-12-07 14:27:12,520 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_39 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_39 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_39) 0)))) is different from true [2019-12-07 14:27:14,560 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_40 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_40 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_40) 0)))) is different from true [2019-12-07 14:27:26,607 WARN L192 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2019-12-07 14:27:28,652 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 14:27:30,699 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 14:27:32,741 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2019-12-07 14:27:34,797 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 14:27:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 9 not checked. [2019-12-07 14:27:34,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:27:34,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 56 [2019-12-07 14:27:34,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445291555] [2019-12-07 14:27:34,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-07 14:27:34,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:27:34,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-07 14:27:34,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2399, Unknown=10, NotChecked=510, Total=3080 [2019-12-07 14:27:34,821 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 56 states. [2019-12-07 14:27:37,048 WARN L192 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-07 14:27:39,818 WARN L192 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 14:27:48,384 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 14:28:04,887 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 14:28:05,206 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 14:28:05,504 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 14:28:06,045 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-07 14:28:06,622 WARN L192 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-12-07 14:28:07,189 WARN L192 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-12-07 14:28:07,507 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 14:28:07,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:07,659 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2019-12-07 14:28:07,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 14:28:07,659 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 95 [2019-12-07 14:28:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:07,660 INFO L225 Difference]: With dead ends: 110 [2019-12-07 14:28:07,660 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 14:28:07,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 61.2s TimeCoverageRelationStatistics Valid=424, Invalid=4694, Unknown=14, NotChecked=720, Total=5852 [2019-12-07 14:28:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 14:28:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-12-07 14:28:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 14:28:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-12-07 14:28:07,662 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 95 [2019-12-07 14:28:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:07,662 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-12-07 14:28:07,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-07 14:28:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-12-07 14:28:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 14:28:07,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:07,663 INFO L410 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, 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] [2019-12-07 14:28:07,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:07,864 INFO L410 AbstractCegarLoop]: === Iteration 37 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:28:07,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash 644565223, now seen corresponding path program 1 times [2019-12-07 14:28:07,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:07,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84232606] [2019-12-07 14:28:07,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:28:08,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84232606] [2019-12-07 14:28:08,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680641993] [2019-12-07 14:28:08,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:08,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 121 conjunts are in the unsatisfiable core [2019-12-07 14:28:08,965 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:28:09,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:09,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 14:28:09,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:09,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:09,130 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:28:09,130 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 14:28:09,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:28:09,206 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:09,212 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:09,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:28:09,214 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:09,218 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:09,218 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:28:09,218 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-12-07 14:28:09,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:09,320 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 57 [2019-12-07 14:28:09,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:28:09,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:09,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:09,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-12-07 14:28:09,329 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:09,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:09,334 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:28:09,334 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:38 [2019-12-07 14:28:10,652 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-12-07 14:28:10,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:28:10,688 INFO L343 Elim1Store]: treesize reduction 32, result has 56.8 percent of original size [2019-12-07 14:28:10,688 INFO L377 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 2 case distinctions, treesize of input 58 treesize of output 70 [2019-12-07 14:28:10,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:10,710 INFO L614 ElimStorePlain]: treesize reduction 18, result has 79.1 percent of original size [2019-12-07 14:28:10,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:28:10,713 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-12-07 14:28:10,713 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:10,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:10,722 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:28:10,722 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:46 [2019-12-07 14:28:12,099 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|)) (.cse1 (+ sll_circular_update_at_~head.offset 4))) (and (<= (select (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|)))) is different from true [2019-12-07 14:28:12,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:28:12,123 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:12,123 INFO L377 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 2 case distinctions, treesize of input 101 treesize of output 124 [2019-12-07 14:28:12,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:28:12,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:28:12,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:28:12,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 14:28:12,163 INFO L614 ElimStorePlain]: treesize reduction 273, result has 23.5 percent of original size [2019-12-07 14:28:12,174 INFO L343 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2019-12-07 14:28:12,175 INFO L377 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 1 case distinctions, treesize of input 76 treesize of output 48 [2019-12-07 14:28:12,175 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:12,188 INFO L614 ElimStorePlain]: treesize reduction 6, result has 87.2 percent of original size [2019-12-07 14:28:12,188 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:28:12,188 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:115, output treesize:38 [2019-12-07 14:28:12,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:12,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 72 [2019-12-07 14:28:12,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:28:12,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:28:12,585 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:28:12,603 INFO L614 ElimStorePlain]: treesize reduction 12, result has 78.9 percent of original size [2019-12-07 14:28:12,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:12,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-12-07 14:28:12,607 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:12,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:12,615 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:28:12,615 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:20 [2019-12-07 14:28:12,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:28:12,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:28:12,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:28:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 2 not checked. [2019-12-07 14:28:12,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:28:12,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 59 [2019-12-07 14:28:12,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101701194] [2019-12-07 14:28:12,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-12-07 14:28:12,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:12,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-12-07 14:28:12,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3013, Unknown=2, NotChecked=222, Total=3422 [2019-12-07 14:28:12,747 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 59 states. [2019-12-07 14:28:17,543 WARN L192 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2019-12-07 14:28:21,067 WARN L192 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2019-12-07 14:28:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:22,444 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2019-12-07 14:28:22,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 14:28:22,444 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 95 [2019-12-07 14:28:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:22,445 INFO L225 Difference]: With dead ends: 96 [2019-12-07 14:28:22,445 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 14:28:22,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=494, Invalid=5674, Unknown=2, NotChecked=310, Total=6480 [2019-12-07 14:28:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 14:28:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-12-07 14:28:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 14:28:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-12-07 14:28:22,447 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 95 [2019-12-07 14:28:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:22,448 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-12-07 14:28:22,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-12-07 14:28:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-12-07 14:28:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 14:28:22,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:22,448 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:22,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:22,649 INFO L410 AbstractCegarLoop]: === Iteration 38 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:28:22,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:22,650 INFO L82 PathProgramCache]: Analyzing trace with hash 951845527, now seen corresponding path program 1 times [2019-12-07 14:28:22,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:22,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658608295] [2019-12-07 14:28:22,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:28:23,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658608295] [2019-12-07 14:28:23,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458687071] [2019-12-07 14:28:23,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:23,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:28:23,409 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:28:23,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:28:23,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:28:23,564 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:23,565 INFO L377 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 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 14:28:23,565 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:23,568 INFO L377 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 12 treesize of output 14 [2019-12-07 14:28:23,568 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:23,589 INFO L614 ElimStorePlain]: treesize reduction 23, result has 54.0 percent of original size [2019-12-07 14:28:23,589 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:28:23,589 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:24 [2019-12-07 14:28:23,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:28:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 14:28:23,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:28:23,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7] total 39 [2019-12-07 14:28:23,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154027541] [2019-12-07 14:28:23,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 14:28:23,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:28:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 14:28:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1452, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 14:28:23,673 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 40 states. [2019-12-07 14:28:25,231 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 14:28:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:25,628 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-12-07 14:28:25,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 14:28:25,628 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 97 [2019-12-07 14:28:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:25,629 INFO L225 Difference]: With dead ends: 95 [2019-12-07 14:28:25,629 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 14:28:25,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=317, Invalid=3223, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 14:28:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 14:28:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-12-07 14:28:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 14:28:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-12-07 14:28:25,631 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 97 [2019-12-07 14:28:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:25,631 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-12-07 14:28:25,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 14:28:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-12-07 14:28:25,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 14:28:25,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:25,632 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:25,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:25,833 INFO L410 AbstractCegarLoop]: === Iteration 39 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 14:28:25,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:25,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1618578629, now seen corresponding path program 1 times [2019-12-07 14:28:25,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:28:25,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194005411] [2019-12-07 14:28:25,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 14:28:27,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194005411] [2019-12-07 14:28:27,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069515588] [2019-12-07 14:28:27,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:27,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 107 conjunts are in the unsatisfiable core [2019-12-07 14:28:27,190 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:28:27,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 14:28:27,499 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:27,506 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:27,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:28:27,506 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-12-07 14:28:27,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:27,616 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 56 [2019-12-07 14:28:27,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:28:27,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:28:27,637 INFO L614 ElimStorePlain]: treesize reduction 39, result has 51.9 percent of original size [2019-12-07 14:28:27,637 INFO L534 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. [2019-12-07 14:28:27,637 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-12-07 14:28:27,893 INFO L377 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 23 treesize of output 16 [2019-12-07 14:28:27,893 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:27,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:27,903 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:27,903 INFO L377 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 24 treesize of output 27 [2019-12-07 14:28:27,904 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:28:27,907 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:27,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:28:27,908 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:17 [2019-12-07 14:28:35,572 WARN L192 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 14:28:35,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:28:35,598 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 14:28:35,598 INFO L377 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 2 case distinctions, treesize of input 53 treesize of output 57 [2019-12-07 14:28:35,598 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:35,623 INFO L614 ElimStorePlain]: treesize reduction 14, result has 80.6 percent of original size [2019-12-07 14:28:35,623 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 14:28:35,624 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:55 [2019-12-07 14:28:35,702 INFO L377 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 23 treesize of output 16 [2019-12-07 14:28:35,702 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:35,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:35,712 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:35,712 INFO L377 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 24 treesize of output 27 [2019-12-07 14:28:35,712 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:28:35,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:35,716 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:28:35,716 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:17 [2019-12-07 14:28:47,977 WARN L192 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 14:28:48,010 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:48,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 133 [2019-12-07 14:28:48,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:28:48,011 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:28:48,050 INFO L614 ElimStorePlain]: treesize reduction 135, result has 31.1 percent of original size [2019-12-07 14:28:48,051 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:28:48,051 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:86, output treesize:44 [2019-12-07 14:28:50,537 INFO L377 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 23 treesize of output 16 [2019-12-07 14:28:50,537 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:50,542 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:50,542 INFO L534 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. [2019-12-07 14:28:50,542 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-12-07 14:28:55,286 INFO L377 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 23 treesize of output 16 [2019-12-07 14:28:55,287 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:55,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:55,291 INFO L534 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. [2019-12-07 14:28:55,291 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-12-07 14:28:59,045 INFO L377 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 23 treesize of output 16 [2019-12-07 14:28:59,045 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:59,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:59,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:59,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 14:28:59,054 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:28:59,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:28:59,057 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:28:59,057 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2019-12-07 14:29:13,129 WARN L192 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2019-12-07 14:29:21,205 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2019-12-07 14:29:23,282 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 14:29:25,359 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 14:29:27,453 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-12-07 14:29:29,539 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 14:29:31,640 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 14:29:31,652 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:29:31,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2019-12-07 14:29:31,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:31,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:31,664 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:29:31,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:31,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 31 [2019-12-07 14:29:31,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:31,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:31,667 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:31,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:31,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:31,679 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 14:29:31,679 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:49 [2019-12-07 14:29:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 2 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 14:29:31,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:29:31,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 64 [2019-12-07 14:29:31,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203878170] [2019-12-07 14:29:31,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-12-07 14:29:31,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:29:31,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-12-07 14:29:31,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3932, Unknown=33, NotChecked=0, Total=4160 [2019-12-07 14:29:31,837 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 65 states. [2019-12-07 14:30:44,265 WARN L192 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-12-07 14:30:54,329 WARN L192 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-12-07 14:31:03,249 WARN L192 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-07 14:31:33,634 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-12-07 14:31:34,756 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-12-07 14:31:37,010 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-12-07 14:31:39,148 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 14:31:41,285 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 14:31:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:31:41,502 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-12-07 14:31:41,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 14:31:41,503 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 101 [2019-12-07 14:31:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:31:41,503 INFO L225 Difference]: With dead ends: 94 [2019-12-07 14:31:41,503 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:31:41,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 109.8s TimeCoverageRelationStatistics Valid=480, Invalid=7474, Unknown=56, NotChecked=0, Total=8010 [2019-12-07 14:31:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:31:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:31:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:31:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:31:41,504 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2019-12-07 14:31:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:31:41,504 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:31:41,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-12-07 14:31:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:31:41,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:31:41,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:31:41,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:31:41 BoogieIcfgContainer [2019-12-07 14:31:41,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:31:41,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:31:41,716 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:31:41,717 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:31:41,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:22" (3/4) ... [2019-12-07 14:31:41,724 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:31:41,738 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 14:31:41,739 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-12-07 14:31:41,739 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_get_data_at [2019-12-07 14:31:41,739 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 14:31:41,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 14:31:41,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2019-12-07 14:31:41,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_destroy [2019-12-07 14:31:41,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 14:31:41,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_update_at [2019-12-07 14:31:41,741 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-12-07 14:31:41,749 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-12-07 14:31:41,750 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 14:31:41,750 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 14:31:41,750 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 14:31:41,782 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_366f0655-644f-4d8b-9826-05f29a2bc69c/bin/uautomizer/witness.graphml [2019-12-07 14:31:41,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:31:41,783 INFO L168 Benchmark]: Toolchain (without parser) took 499974.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 934.3 MB in the beginning and 889.7 MB in the end (delta: 44.7 MB). Peak memory consumption was 151.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:31:41,784 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:31:41,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -116.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:31:41,784 INFO L168 Benchmark]: Boogie Preprocessor took 40.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:31:41,784 INFO L168 Benchmark]: RCFGBuilder took 374.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 985.1 MB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:31:41,784 INFO L168 Benchmark]: TraceAbstraction took 499161.08 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.7 MB). Free memory was 985.1 MB in the beginning and 898.6 MB in the end (delta: 86.5 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:31:41,785 INFO L168 Benchmark]: Witness Printer took 66.63 ms. Allocated memory is still 1.1 GB. Free memory was 898.6 MB in the beginning and 889.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:31:41,786 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -116.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 374.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 985.1 MB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 499161.08 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.7 MB). Free memory was 985.1 MB in the beginning and 898.6 MB in the end (delta: 86.5 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. * Witness Printer took 66.63 ms. Allocated memory is still 1.1 GB. Free memory was 898.6 MB in the beginning and 889.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 609]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 111 locations, 28 error locations. Result: SAFE, OverallTime: 499.1s, OverallIterations: 39, TraceHistogramMax: 3, AutomataDifference: 308.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2428 SDtfs, 7394 SDslu, 13163 SDs, 0 SdLazy, 48193 SolverSat, 1682 SolverUnsat, 134 SolverUnknown, 0 SolverNotchecked, 158.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3090 GetRequests, 1684 SyntacticMatches, 51 SemanticMatches, 1355 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 15016 ImplicationChecksByTransitivity, 321.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 834 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 182.9s InterpolantComputationTime, 4023 NumberOfCodeBlocks, 4023 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 3961 ConstructedInterpolants, 340 QuantifiedInterpolants, 2942807 SizeOfPredicates, 333 NumberOfNonLiveVariables, 8020 ConjunctsInSsa, 1227 ConjunctsInUnsatCore, 62 InterpolantComputations, 19 PerfectInterpolantSequences, 988/1410 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...