./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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 db17479a00afa98e4ce70a37e790a923b748e4dc ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:58:05,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:58:05,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:58:05,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:58:05,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:58:05,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:58:05,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:58:05,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:58:05,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:58:05,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:58:05,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:58:05,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:58:05,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:58:05,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:58:05,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:58:05,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:58:05,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:58:05,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:58:05,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:58:05,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:58:05,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:58:05,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:58:05,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:58:05,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:58:05,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:58:05,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:58:05,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:58:05,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:58:05,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:58:05,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:58:05,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:58:05,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:58:05,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:58:05,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:58:05,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:58:05,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:58:05,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:58:05,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:58:05,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:58:05,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:58:05,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:58:05,333 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:58:05,345 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:58:05,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:58:05,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:58:05,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:58:05,347 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:58:05,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:58:05,347 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:58:05,347 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:58:05,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:58:05,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:58:05,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:58:05,348 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:58:05,349 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:58:05,349 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:58:05,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:58:05,349 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:58:05,350 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:58:05,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:58:05,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:58:05,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:58:05,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:58:05,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:58:05,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:58:05,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:58:05,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:58:05,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:58:05,352 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_d64a4958-6f98-4e31-9ace-87eeda926fa3/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 -> db17479a00afa98e4ce70a37e790a923b748e4dc [2019-11-15 21:58:05,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:58:05,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:58:05,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:58:05,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:58:05,392 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:58:05,393 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-11-15 21:58:05,439 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/bin/uautomizer/data/711be7df6/6b89a65628984ea8a38ed8dd8dd9be17/FLAG0df93f1be [2019-11-15 21:58:05,966 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:58:05,967 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-11-15 21:58:05,978 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/bin/uautomizer/data/711be7df6/6b89a65628984ea8a38ed8dd8dd9be17/FLAG0df93f1be [2019-11-15 21:58:06,462 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/bin/uautomizer/data/711be7df6/6b89a65628984ea8a38ed8dd8dd9be17 [2019-11-15 21:58:06,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:58:06,466 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:58:06,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:58:06,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:58:06,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:58:06,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:58:06" (1/1) ... [2019-11-15 21:58:06,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798bea11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:06, skipping insertion in model container [2019-11-15 21:58:06,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:58:06" (1/1) ... [2019-11-15 21:58:06,480 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:58:06,515 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:58:06,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:58:06,858 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:58:06,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:58:07,001 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:58:07,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:07 WrapperNode [2019-11-15 21:58:07,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:58:07,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:58:07,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:58:07,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:58:07,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:07" (1/1) ... [2019-11-15 21:58:07,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:07" (1/1) ... [2019-11-15 21:58:07,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:07" (1/1) ... [2019-11-15 21:58:07,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:07" (1/1) ... [2019-11-15 21:58:07,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:07" (1/1) ... [2019-11-15 21:58:07,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:07" (1/1) ... [2019-11-15 21:58:07,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:07" (1/1) ... [2019-11-15 21:58:07,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:58:07,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:58:07,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:58:07,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:58:07,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 21:58:07,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:58:07,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:58:07,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:58:07,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:58:07,138 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 21:58:07,138 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 21:58:07,138 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-15 21:58:07,139 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-15 21:58:07,139 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2019-11-15 21:58:07,139 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2019-11-15 21:58:07,139 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:58:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:58:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:58:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:58:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:58:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:58:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:58:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:58:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:58:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:58:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:58:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:58:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:58:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:58:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:58:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:58:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:58:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:58:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:58:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:58:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:58:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:58:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:58:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:58:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:58:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:58:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:58:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:58:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:58:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:58:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:58:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:58:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:58:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:58:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:58:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:58:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:58:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:58:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:58:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:58:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:58:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:58:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:58:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:58:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:58:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:58:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:58:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:58:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:58:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:58:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:58:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:58:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:58:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:58:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:58:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:58:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:58:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:58:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:58:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:58:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:58:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:58:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:58:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:58:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:58:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:58:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:58:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:58:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:58:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:58:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:58:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:58:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:58:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:58:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:58:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:58:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:58:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:58:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:58:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:58:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:58:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:58:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:58:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:58:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:58:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:58:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:58:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:58:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:58:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:58:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:58:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:58:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:58:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:58:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:58:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:58:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:58:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:58:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:58:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 21:58:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 21:58:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:58:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:58:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:58:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-15 21:58:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-15 21:58:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:58:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:58:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2019-11-15 21:58:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:58:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2019-11-15 21:58:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:58:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:58:07,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:58:07,417 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 21:58:07,704 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:58:07,704 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 21:58:07,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:58:07 BoogieIcfgContainer [2019-11-15 21:58:07,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:58:07,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:58:07,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:58:07,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:58:07,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:58:06" (1/3) ... [2019-11-15 21:58:07,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f410693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:58:07, skipping insertion in model container [2019-11-15 21:58:07,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:07" (2/3) ... [2019-11-15 21:58:07,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f410693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:58:07, skipping insertion in model container [2019-11-15 21:58:07,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:58:07" (3/3) ... [2019-11-15 21:58:07,712 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2019-11-15 21:58:07,721 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:58:07,728 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2019-11-15 21:58:07,738 INFO L249 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2019-11-15 21:58:07,756 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:58:07,756 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:58:07,756 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:58:07,756 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:58:07,757 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:58:07,757 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:58:07,757 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:58:07,757 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:58:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-11-15 21:58:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:58:07,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:07,782 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:07,784 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:07,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:07,789 INFO L82 PathProgramCache]: Analyzing trace with hash -154446967, now seen corresponding path program 1 times [2019-11-15 21:58:07,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:07,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920433500] [2019-11-15 21:58:07,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:07,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:07,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:07,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920433500] [2019-11-15 21:58:07,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:07,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:58:07,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53793368] [2019-11-15 21:58:07,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:58:07,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:08,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:58:08,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:58:08,014 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2019-11-15 21:58:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:08,355 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2019-11-15 21:58:08,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:58:08,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 21:58:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:08,367 INFO L225 Difference]: With dead ends: 120 [2019-11-15 21:58:08,367 INFO L226 Difference]: Without dead ends: 113 [2019-11-15 21:58:08,368 INFO L600 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-11-15 21:58:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-15 21:58:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2019-11-15 21:58:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 21:58:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-11-15 21:58:08,421 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 12 [2019-11-15 21:58:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:08,422 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-11-15 21:58:08,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:58:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-11-15 21:58:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:58:08,423 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:08,423 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:08,424 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:08,424 INFO L82 PathProgramCache]: Analyzing trace with hash -154446966, now seen corresponding path program 1 times [2019-11-15 21:58:08,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:08,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038843178] [2019-11-15 21:58:08,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:08,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:08,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:08,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038843178] [2019-11-15 21:58:08,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:08,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:58:08,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486401755] [2019-11-15 21:58:08,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:58:08,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:58:08,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:58:08,557 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 4 states. [2019-11-15 21:58:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:08,833 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2019-11-15 21:58:08,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:58:08,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 21:58:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:08,835 INFO L225 Difference]: With dead ends: 111 [2019-11-15 21:58:08,836 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 21:58:08,836 INFO L600 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-11-15 21:58:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 21:58:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2019-11-15 21:58:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 21:58:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-11-15 21:58:08,857 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 12 [2019-11-15 21:58:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:08,857 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-11-15 21:58:08,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:58:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-11-15 21:58:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:58:08,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:08,859 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:08,859 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:08,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash -308881252, now seen corresponding path program 1 times [2019-11-15 21:58:08,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:08,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484143570] [2019-11-15 21:58:08,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:08,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:08,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:09,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484143570] [2019-11-15 21:58:09,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:09,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:58:09,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208211322] [2019-11-15 21:58:09,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:58:09,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:09,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:58:09,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:58:09,049 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 8 states. [2019-11-15 21:58:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:09,601 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-11-15 21:58:09,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:58:09,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-15 21:58:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:09,603 INFO L225 Difference]: With dead ends: 115 [2019-11-15 21:58:09,603 INFO L226 Difference]: Without dead ends: 115 [2019-11-15 21:58:09,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:58:09,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-15 21:58:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 94. [2019-11-15 21:58:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 21:58:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2019-11-15 21:58:09,614 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 19 [2019-11-15 21:58:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:09,615 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2019-11-15 21:58:09,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:58:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2019-11-15 21:58:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:58:09,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:09,616 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:09,617 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:09,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash -308881251, now seen corresponding path program 1 times [2019-11-15 21:58:09,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:09,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548866257] [2019-11-15 21:58:09,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:09,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:09,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:09,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548866257] [2019-11-15 21:58:09,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:09,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:58:09,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906970107] [2019-11-15 21:58:09,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:58:09,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:58:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:58:09,749 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 7 states. [2019-11-15 21:58:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:10,159 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-15 21:58:10,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:58:10,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-15 21:58:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:10,161 INFO L225 Difference]: With dead ends: 112 [2019-11-15 21:58:10,161 INFO L226 Difference]: Without dead ends: 112 [2019-11-15 21:58:10,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:58:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-15 21:58:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2019-11-15 21:58:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 21:58:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2019-11-15 21:58:10,169 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 19 [2019-11-15 21:58:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:10,169 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2019-11-15 21:58:10,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:58:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2019-11-15 21:58:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 21:58:10,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:10,170 INFO L380 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-11-15 21:58:10,171 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1499366792, now seen corresponding path program 1 times [2019-11-15 21:58:10,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:10,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702473340] [2019-11-15 21:58:10,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:10,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:10,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:58:10,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702473340] [2019-11-15 21:58:10,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:10,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:58:10,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577721138] [2019-11-15 21:58:10,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:58:10,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:10,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:58:10,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:58:10,312 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 8 states. [2019-11-15 21:58:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:10,734 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-11-15 21:58:10,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:58:10,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-15 21:58:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:10,735 INFO L225 Difference]: With dead ends: 112 [2019-11-15 21:58:10,736 INFO L226 Difference]: Without dead ends: 112 [2019-11-15 21:58:10,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:58:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-15 21:58:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2019-11-15 21:58:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 21:58:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-11-15 21:58:10,743 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 28 [2019-11-15 21:58:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:10,743 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-11-15 21:58:10,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:58:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-11-15 21:58:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 21:58:10,744 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:10,744 INFO L380 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-11-15 21:58:10,745 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:10,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:10,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1499366791, now seen corresponding path program 1 times [2019-11-15 21:58:10,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:10,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516941631] [2019-11-15 21:58:10,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:10,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:10,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:58:10,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516941631] [2019-11-15 21:58:10,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:10,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:58:10,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160537133] [2019-11-15 21:58:10,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:58:10,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:10,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:58:10,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:58:10,893 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 8 states. [2019-11-15 21:58:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:11,261 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2019-11-15 21:58:11,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:58:11,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-15 21:58:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:11,262 INFO L225 Difference]: With dead ends: 111 [2019-11-15 21:58:11,263 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 21:58:11,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:58:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 21:58:11,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2019-11-15 21:58:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-15 21:58:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-11-15 21:58:11,270 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 28 [2019-11-15 21:58:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:11,270 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-11-15 21:58:11,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:58:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-11-15 21:58:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:58:11,272 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:11,272 INFO L380 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-11-15 21:58:11,272 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:11,273 INFO L82 PathProgramCache]: Analyzing trace with hash 23894858, now seen corresponding path program 1 times [2019-11-15 21:58:11,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:11,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736748391] [2019-11-15 21:58:11,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:11,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:11,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:58:11,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736748391] [2019-11-15 21:58:11,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369475253] [2019-11-15 21:58:11,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 21:58:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:11,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 21:58:11,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:11,807 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:58:11,825 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:11,826 INFO L375 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-11-15 21:58:11,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:11,844 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 21:58:11,845 INFO L496 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-11-15 21:58:11,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-15 21:58:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:58:11,854 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:11,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-15 21:58:11,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130949332] [2019-11-15 21:58:11,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:58:11,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:11,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:58:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:58:11,857 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2019-11-15 21:58:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:12,806 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2019-11-15 21:58:12,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:58:12,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-15 21:58:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:12,808 INFO L225 Difference]: With dead ends: 125 [2019-11-15 21:58:12,808 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 21:58:12,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-11-15 21:58:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 21:58:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 90. [2019-11-15 21:58:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 21:58:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2019-11-15 21:58:12,823 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 31 [2019-11-15 21:58:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:12,823 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2019-11-15 21:58:12,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:58:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2019-11-15 21:58:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:58:12,826 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:12,826 INFO L380 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-11-15 21:58:13,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:13,027 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:13,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash 23894859, now seen corresponding path program 1 times [2019-11-15 21:58:13,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:13,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550076222] [2019-11-15 21:58:13,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:13,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:13,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:58:13,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550076222] [2019-11-15 21:58:13,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665077300] [2019-11-15 21:58:13,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 21:58:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 21:58:13,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:13,392 INFO L375 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-11-15 21:58:13,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:13,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:13,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:13,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 21:58:13,608 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:13,608 INFO L375 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-11-15 21:58:13,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:13,631 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-15 21:58:13,631 INFO L496 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-11-15 21:58:13,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-11-15 21:58:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:58:13,652 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:13,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-15 21:58:13,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454926710] [2019-11-15 21:58:13,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 21:58:13,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:13,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:58:13,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:58:13,653 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 16 states. [2019-11-15 21:58:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:14,606 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2019-11-15 21:58:14,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:58:14,607 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-15 21:58:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:14,608 INFO L225 Difference]: With dead ends: 110 [2019-11-15 21:58:14,608 INFO L226 Difference]: Without dead ends: 110 [2019-11-15 21:58:14,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:58:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-15 21:58:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2019-11-15 21:58:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 21:58:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2019-11-15 21:58:14,612 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 31 [2019-11-15 21:58:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:14,613 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2019-11-15 21:58:14,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 21:58:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2019-11-15 21:58:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 21:58:14,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:14,614 INFO L380 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-11-15 21:58:14,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:14,818 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:14,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:14,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1977617260, now seen corresponding path program 1 times [2019-11-15 21:58:14,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:14,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900196819] [2019-11-15 21:58:14,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:14,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:14,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:58:15,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900196819] [2019-11-15 21:58:15,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:15,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 21:58:15,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608868048] [2019-11-15 21:58:15,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 21:58:15,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:15,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:58:15,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:58:15,037 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 14 states. [2019-11-15 21:58:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:15,862 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2019-11-15 21:58:15,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:58:15,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-11-15 21:58:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:15,863 INFO L225 Difference]: With dead ends: 117 [2019-11-15 21:58:15,863 INFO L226 Difference]: Without dead ends: 117 [2019-11-15 21:58:15,864 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:58:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-15 21:58:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 92. [2019-11-15 21:58:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 21:58:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-11-15 21:58:15,868 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 40 [2019-11-15 21:58:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:15,869 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-11-15 21:58:15,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 21:58:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-11-15 21:58:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 21:58:15,870 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:15,871 INFO L380 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-11-15 21:58:15,871 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:15,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:15,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1977617261, now seen corresponding path program 1 times [2019-11-15 21:58:15,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:15,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772668539] [2019-11-15 21:58:15,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:15,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:15,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:58:15,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772668539] [2019-11-15 21:58:15,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:15,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:58:15,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341193616] [2019-11-15 21:58:15,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:58:15,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:15,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:58:15,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:58:15,978 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 8 states. [2019-11-15 21:58:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:16,461 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-11-15 21:58:16,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:58:16,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-15 21:58:16,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:16,463 INFO L225 Difference]: With dead ends: 132 [2019-11-15 21:58:16,463 INFO L226 Difference]: Without dead ends: 132 [2019-11-15 21:58:16,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:58:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-15 21:58:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 104. [2019-11-15 21:58:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 21:58:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-11-15 21:58:16,476 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 40 [2019-11-15 21:58:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:16,476 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-11-15 21:58:16,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:58:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-11-15 21:58:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 21:58:16,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:16,480 INFO L380 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-11-15 21:58:16,481 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1977617316, now seen corresponding path program 1 times [2019-11-15 21:58:16,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:16,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112611282] [2019-11-15 21:58:16,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:16,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:16,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:58:16,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112611282] [2019-11-15 21:58:16,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:16,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 21:58:16,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620477835] [2019-11-15 21:58:16,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 21:58:16,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:16,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:58:16,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:58:16,796 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 14 states. [2019-11-15 21:58:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:17,598 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2019-11-15 21:58:17,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:58:17,599 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-11-15 21:58:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:17,601 INFO L225 Difference]: With dead ends: 128 [2019-11-15 21:58:17,601 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 21:58:17,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:58:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 21:58:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2019-11-15 21:58:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 21:58:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2019-11-15 21:58:17,606 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 40 [2019-11-15 21:58:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:17,606 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2019-11-15 21:58:17,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 21:58:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2019-11-15 21:58:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:58:17,608 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:17,608 INFO L380 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-11-15 21:58:17,608 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:17,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:17,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1131082394, now seen corresponding path program 1 times [2019-11-15 21:58:17,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:17,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23884552] [2019-11-15 21:58:17,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:17,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:17,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:58:18,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23884552] [2019-11-15 21:58:18,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369248120] [2019-11-15 21:58:18,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 21:58:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:18,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-15 21:58:18,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:18,551 INFO L375 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-11-15 21:58:18,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:18,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:18,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:18,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-15 21:58:18,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:58:18,661 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:18,661 INFO L375 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 29 treesize of output 39 [2019-11-15 21:58:18,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:58:18,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:58:18,690 INFO L567 ElimStorePlain]: treesize reduction 21, result has 65.0 percent of original size [2019-11-15 21:58:18,691 INFO L496 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-11-15 21:58:18,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2019-11-15 21:58:19,029 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:58:19,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:19,033 INFO L375 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 28 treesize of output 23 [2019-11-15 21:58:19,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:19,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:19,044 INFO L496 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-11-15 21:58:19,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:11 [2019-11-15 21:58:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:58:19,078 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:19,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2019-11-15 21:58:19,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576704883] [2019-11-15 21:58:19,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-15 21:58:19,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:19,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-15 21:58:19,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1391, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 21:58:19,081 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 39 states. [2019-11-15 21:58:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:21,001 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2019-11-15 21:58:21,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 21:58:21,001 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 43 [2019-11-15 21:58:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:21,003 INFO L225 Difference]: With dead ends: 153 [2019-11-15 21:58:21,003 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 21:58:21,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=227, Invalid=2853, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 21:58:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 21:58:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2019-11-15 21:58:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 21:58:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2019-11-15 21:58:21,014 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 43 [2019-11-15 21:58:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:21,015 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2019-11-15 21:58:21,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-15 21:58:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2019-11-15 21:58:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:58:21,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:21,016 INFO L380 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-11-15 21:58:21,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:21,227 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:21,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:21,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1131082395, now seen corresponding path program 1 times [2019-11-15 21:58:21,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:21,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482335744] [2019-11-15 21:58:21,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:21,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:21,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:58:21,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482335744] [2019-11-15 21:58:21,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562561383] [2019-11-15 21:58:21,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 21:58:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 90 conjunts are in the unsatisfiable core [2019-11-15 21:58:21,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:22,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:58:22,387 INFO L375 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-11-15 21:58:22,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:22,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:22,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:22,420 INFO L375 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-11-15 21:58:22,420 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:22,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:22,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:22,434 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:35 [2019-11-15 21:58:22,552 INFO L375 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-11-15 21:58:22,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:22,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:22,593 INFO L375 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-11-15 21:58:22,593 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:22,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:22,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:22,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-11-15 21:58:22,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:58:22,757 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:22,757 INFO L375 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 70 treesize of output 68 [2019-11-15 21:58:22,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:58:22,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:58:22,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:22,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:22,801 INFO L375 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 68 treesize of output 50 [2019-11-15 21:58:22,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:22,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:22,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:22,825 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:79 [2019-11-15 21:58:23,335 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:58:23,338 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:23,339 INFO L375 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 61 treesize of output 44 [2019-11-15 21:58:23,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:23,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:23,360 INFO L375 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 23 [2019-11-15 21:58:23,360 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:23,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:23,371 INFO L496 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-11-15 21:58:23,371 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:23 [2019-11-15 21:58:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:23,508 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:23,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2019-11-15 21:58:23,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446475150] [2019-11-15 21:58:23,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 21:58:23,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:23,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 21:58:23,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1874, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 21:58:23,511 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand 45 states. [2019-11-15 21:58:24,817 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-11-15 21:58:25,298 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-11-15 21:58:25,516 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2019-11-15 21:58:26,231 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-11-15 21:58:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:27,385 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2019-11-15 21:58:27,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 21:58:27,386 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 43 [2019-11-15 21:58:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:27,387 INFO L225 Difference]: With dead ends: 187 [2019-11-15 21:58:27,387 INFO L226 Difference]: Without dead ends: 187 [2019-11-15 21:58:27,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=280, Invalid=3752, Unknown=0, NotChecked=0, Total=4032 [2019-11-15 21:58:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-15 21:58:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 137. [2019-11-15 21:58:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 21:58:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2019-11-15 21:58:27,396 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 43 [2019-11-15 21:58:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:27,396 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2019-11-15 21:58:27,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 21:58:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2019-11-15 21:58:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 21:58:27,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:27,398 INFO L380 BasicCegarLoop]: trace histogram [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-11-15 21:58:27,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:27,601 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:27,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2058851500, now seen corresponding path program 2 times [2019-11-15 21:58:27,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:27,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399082940] [2019-11-15 21:58:27,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:27,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:27,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:58:27,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399082940] [2019-11-15 21:58:27,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:27,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:58:27,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425022955] [2019-11-15 21:58:27,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:58:27,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:27,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:58:27,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:58:27,719 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand 9 states. [2019-11-15 21:58:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:28,092 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2019-11-15 21:58:28,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:58:28,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-11-15 21:58:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:28,093 INFO L225 Difference]: With dead ends: 151 [2019-11-15 21:58:28,093 INFO L226 Difference]: Without dead ends: 151 [2019-11-15 21:58:28,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:58:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-15 21:58:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 132. [2019-11-15 21:58:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 21:58:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2019-11-15 21:58:28,098 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 46 [2019-11-15 21:58:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:28,099 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2019-11-15 21:58:28,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:58:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2019-11-15 21:58:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 21:58:28,100 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:28,100 INFO L380 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-11-15 21:58:28,100 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:28,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:28,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2085780180, now seen corresponding path program 1 times [2019-11-15 21:58:28,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:28,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720214269] [2019-11-15 21:58:28,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:28,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:28,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:58:28,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720214269] [2019-11-15 21:58:28,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330194938] [2019-11-15 21:58:28,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 21:58:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:28,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:58:28,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:58:28,542 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:28,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 18 [2019-11-15 21:58:28,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378887924] [2019-11-15 21:58:28,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 21:58:28,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:28,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:58:28,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:58:28,544 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand 18 states. [2019-11-15 21:58:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:29,264 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2019-11-15 21:58:29,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:58:29,265 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2019-11-15 21:58:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:29,266 INFO L225 Difference]: With dead ends: 164 [2019-11-15 21:58:29,266 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 21:58:29,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2019-11-15 21:58:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 21:58:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 145. [2019-11-15 21:58:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-15 21:58:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 160 transitions. [2019-11-15 21:58:29,273 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 160 transitions. Word has length 53 [2019-11-15 21:58:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:29,274 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 160 transitions. [2019-11-15 21:58:29,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 21:58:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2019-11-15 21:58:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 21:58:29,275 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:29,275 INFO L380 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-11-15 21:58:29,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:29,478 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1682133992, now seen corresponding path program 1 times [2019-11-15 21:58:29,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:29,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044788755] [2019-11-15 21:58:29,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:29,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:29,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:58:29,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044788755] [2019-11-15 21:58:29,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579461304] [2019-11-15 21:58:29,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 21:58:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:29,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:58:29,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:58:29,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:58:29,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 10 [2019-11-15 21:58:29,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552805336] [2019-11-15 21:58:29,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:58:29,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:29,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:58:29,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:58:29,815 INFO L87 Difference]: Start difference. First operand 145 states and 160 transitions. Second operand 7 states. [2019-11-15 21:58:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:29,888 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2019-11-15 21:58:29,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:58:29,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-15 21:58:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:29,892 INFO L225 Difference]: With dead ends: 133 [2019-11-15 21:58:29,892 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 21:58:29,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:58:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 21:58:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2019-11-15 21:58:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 21:58:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2019-11-15 21:58:29,896 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 54 [2019-11-15 21:58:29,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:29,897 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2019-11-15 21:58:29,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:58:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2019-11-15 21:58:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 21:58:29,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:29,898 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-11-15 21:58:30,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:30,101 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:30,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash -613479608, now seen corresponding path program 3 times [2019-11-15 21:58:30,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:30,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109528365] [2019-11-15 21:58:30,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:30,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:30,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 21:58:30,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109528365] [2019-11-15 21:58:30,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716455391] [2019-11-15 21:58:30,223 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 21:58:30,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-15 21:58:30,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:58:30,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:58:30,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 21:58:30,420 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:30,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 21:58:30,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231877724] [2019-11-15 21:58:30,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:58:30,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:30,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:58:30,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:58:30,421 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 9 states. [2019-11-15 21:58:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:30,910 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2019-11-15 21:58:30,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:58:30,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-15 21:58:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:30,912 INFO L225 Difference]: With dead ends: 129 [2019-11-15 21:58:30,912 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 21:58:30,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:58:30,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 21:58:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2019-11-15 21:58:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 21:58:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2019-11-15 21:58:30,918 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 55 [2019-11-15 21:58:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:30,919 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2019-11-15 21:58:30,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:58:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2019-11-15 21:58:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 21:58:30,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:30,920 INFO L380 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] [2019-11-15 21:58:31,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:31,125 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:31,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash 823098432, now seen corresponding path program 2 times [2019-11-15 21:58:31,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:31,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249765993] [2019-11-15 21:58:31,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:31,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:31,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 21:58:31,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249765993] [2019-11-15 21:58:31,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:31,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:58:31,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395905984] [2019-11-15 21:58:31,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:58:31,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:31,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:58:31,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:58:31,262 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 9 states. [2019-11-15 21:58:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:31,609 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2019-11-15 21:58:31,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:58:31,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-11-15 21:58:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:31,610 INFO L225 Difference]: With dead ends: 133 [2019-11-15 21:58:31,610 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 21:58:31,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:58:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 21:58:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2019-11-15 21:58:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 21:58:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-15 21:58:31,613 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 61 [2019-11-15 21:58:31,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:31,614 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-15 21:58:31,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:58:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-15 21:58:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 21:58:31,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:31,614 INFO L380 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] [2019-11-15 21:58:31,615 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:31,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:31,615 INFO L82 PathProgramCache]: Analyzing trace with hash 823098486, now seen corresponding path program 1 times [2019-11-15 21:58:31,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:31,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491988323] [2019-11-15 21:58:31,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:31,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:31,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:58:31,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491988323] [2019-11-15 21:58:31,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:31,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 21:58:31,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271671796] [2019-11-15 21:58:31,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:58:31,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:31,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:58:31,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:58:31,866 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 15 states. [2019-11-15 21:58:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:32,508 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2019-11-15 21:58:32,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:58:32,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2019-11-15 21:58:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:32,509 INFO L225 Difference]: With dead ends: 138 [2019-11-15 21:58:32,509 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 21:58:32,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:58:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 21:58:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2019-11-15 21:58:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 21:58:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2019-11-15 21:58:32,513 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 61 [2019-11-15 21:58:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:32,513 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2019-11-15 21:58:32,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:58:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2019-11-15 21:58:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 21:58:32,514 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:32,514 INFO L380 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] [2019-11-15 21:58:32,514 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:32,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:32,515 INFO L82 PathProgramCache]: Analyzing trace with hash 823098487, now seen corresponding path program 1 times [2019-11-15 21:58:32,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:32,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626616657] [2019-11-15 21:58:32,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:32,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:32,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 21:58:32,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626616657] [2019-11-15 21:58:32,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:32,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 21:58:32,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265727647] [2019-11-15 21:58:32,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 21:58:32,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:58:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:58:32,775 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 15 states. [2019-11-15 21:58:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:33,497 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2019-11-15 21:58:33,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:58:33,497 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2019-11-15 21:58:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:33,498 INFO L225 Difference]: With dead ends: 138 [2019-11-15 21:58:33,498 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 21:58:33,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:58:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 21:58:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2019-11-15 21:58:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 21:58:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2019-11-15 21:58:33,502 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 61 [2019-11-15 21:58:33,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:33,503 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2019-11-15 21:58:33,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 21:58:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2019-11-15 21:58:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:58:33,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:33,504 INFO L380 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-11-15 21:58:33,504 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:58:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash 958842401, now seen corresponding path program 1 times [2019-11-15 21:58:33,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:33,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695008884] [2019-11-15 21:58:33,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:33,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:33,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:58:34,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695008884] [2019-11-15 21:58:34,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300366330] [2019-11-15 21:58:34,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 21:58:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:34,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 96 conjunts are in the unsatisfiable core [2019-11-15 21:58:34,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:35,212 INFO L375 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-11-15 21:58:35,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:35,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:35,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:35,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 21:58:35,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:35,345 INFO L375 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 30 treesize of output 48 [2019-11-15 21:58:35,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:58:35,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:58:35,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:58:35,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:58:35,382 INFO L567 ElimStorePlain]: treesize reduction 110, result has 23.1 percent of original size [2019-11-15 21:58:35,383 INFO L496 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-11-15 21:58:35,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-11-15 21:58:35,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:35,888 INFO L375 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 94 treesize of output 118 [2019-11-15 21:58:35,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:58:35,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:58:35,932 INFO L567 ElimStorePlain]: treesize reduction 68, result has 62.6 percent of original size [2019-11-15 21:58:35,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:35,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:114 [2019-11-15 21:58:36,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:58:36,061 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:36,062 INFO L375 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 77 treesize of output 77 [2019-11-15 21:58:36,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:36,082 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:36,083 INFO L375 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 84 treesize of output 104 [2019-11-15 21:58:36,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:58:36,085 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:36,117 INFO L567 ElimStorePlain]: treesize reduction 123, result has 23.1 percent of original size [2019-11-15 21:58:36,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:36,118 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:162, output treesize:36 [2019-11-15 21:58:36,186 INFO L375 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 15 treesize of output 11 [2019-11-15 21:58:36,187 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:58:36,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:36,200 INFO L375 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-11-15 21:58:36,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:36,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:36,208 INFO L496 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-11-15 21:58:36,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2019-11-15 21:58:56,892 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-15 21:58:56,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:58:56,909 INFO L375 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 19 [2019-11-15 21:58:56,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:56,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:56,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:58:56,938 INFO L375 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 49 treesize of output 25 [2019-11-15 21:58:56,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:56,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:56,957 INFO L496 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-11-15 21:58:56,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:41 [2019-11-15 21:58:57,160 INFO L375 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-11-15 21:58:57,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:57,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:57,178 INFO L375 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 33 treesize of output 17 [2019-11-15 21:58:57,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:57,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:57,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:57,189 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2019-11-15 21:58:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:58:57,322 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:57,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 57 [2019-11-15 21:58:57,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155056297] [2019-11-15 21:58:57,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-11-15 21:58:57,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:57,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-11-15 21:58:57,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3118, Unknown=13, NotChecked=0, Total=3306 [2019-11-15 21:58:57,324 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 58 states. [2019-11-15 21:59:01,543 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-11-15 21:59:05,415 WARN L191 SmtUtils]: Spent 3.45 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 21:59:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:07,506 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2019-11-15 21:59:07,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 21:59:07,507 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 64 [2019-11-15 21:59:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:07,508 INFO L225 Difference]: With dead ends: 155 [2019-11-15 21:59:07,508 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 21:59:07,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=469, Invalid=5998, Unknown=13, NotChecked=0, Total=6480 [2019-11-15 21:59:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 21:59:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2019-11-15 21:59:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 21:59:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2019-11-15 21:59:07,514 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 64 [2019-11-15 21:59:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:07,515 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2019-11-15 21:59:07,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-11-15 21:59:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2019-11-15 21:59:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:59:07,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:07,516 INFO L380 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-11-15 21:59:07,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:59:07,716 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 21:59:07,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:07,717 INFO L82 PathProgramCache]: Analyzing trace with hash 958842400, now seen corresponding path program 1 times [2019-11-15 21:59:07,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:07,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426990498] [2019-11-15 21:59:07,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:07,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:07,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:59:08,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426990498] [2019-11-15 21:59:08,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260913262] [2019-11-15 21:59:08,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 21:59:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:08,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-15 21:59:08,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:59:08,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:59:08,830 INFO L375 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-11-15 21:59:08,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:59:08,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:59:08,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:59:08,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-15 21:59:08,919 INFO L375 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-11-15 21:59:08,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:59:08,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:59:08,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:59:08,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-15 21:59:09,043 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:59:09,043 INFO L375 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-11-15 21:59:09,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:59:09,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:59:09,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:59:09,048 INFO L496 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-11-15 21:59:09,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-11-15 21:59:10,559 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-15 21:59:10,596 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:59:10,596 INFO L375 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-11-15 21:59:10,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:59:10,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:59:10,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:59:10,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:59:10,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:59:10,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:59:10,626 INFO L567 ElimStorePlain]: treesize reduction 151, result has 18.8 percent of original size [2019-11-15 21:59:10,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:59:10,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:18 [2019-11-15 21:59:10,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-11-15 21:59:10,702 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:59:10,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:59:10,707 INFO L496 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-11-15 21:59:10,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:9 [2019-11-15 21:59:26,592 WARN L191 SmtUtils]: Spent 736.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-11-15 21:59:26,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:59:26,608 INFO L375 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 37 treesize of output 17 [2019-11-15 21:59:26,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:59:26,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:59:26,617 INFO L496 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-11-15 21:59:26,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:23 [2019-11-15 21:59:26,785 INFO L375 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-11-15 21:59:26,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:59:26,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:59:26,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:59:26,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-11-15 21:59:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:59:26,812 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:59:26,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 49 [2019-11-15 21:59:26,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749629766] [2019-11-15 21:59:26,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-11-15 21:59:26,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:26,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-11-15 21:59:26,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2300, Unknown=16, NotChecked=0, Total=2450 [2019-11-15 21:59:26,815 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand 50 states. [2019-11-15 21:59:44,550 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 21:59:49,891 WARN L191 SmtUtils]: Spent 786.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 22:00:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:03,433 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2019-11-15 22:00:03,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 22:00:03,435 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 64 [2019-11-15 22:00:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:00:03,436 INFO L225 Difference]: With dead ends: 148 [2019-11-15 22:00:03,436 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 22:00:03,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=417, Invalid=4823, Unknown=16, NotChecked=0, Total=5256 [2019-11-15 22:00:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 22:00:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 121. [2019-11-15 22:00:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 22:00:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2019-11-15 22:00:03,443 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 64 [2019-11-15 22:00:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:00:03,444 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2019-11-15 22:00:03,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-11-15 22:00:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2019-11-15 22:00:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:00:03,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:00:03,445 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:00:03,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:00:03,650 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:00:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash -951769952, now seen corresponding path program 2 times [2019-11-15 22:00:03,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:03,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96890376] [2019-11-15 22:00:03,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:03,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:03,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 22:00:03,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96890376] [2019-11-15 22:00:03,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:00:03,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:00:03,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798908277] [2019-11-15 22:00:03,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:00:03,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:00:03,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:00:03,787 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 10 states. [2019-11-15 22:00:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:04,201 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2019-11-15 22:00:04,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:00:04,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-11-15 22:00:04,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:00:04,202 INFO L225 Difference]: With dead ends: 126 [2019-11-15 22:00:04,202 INFO L226 Difference]: Without dead ends: 126 [2019-11-15 22:00:04,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 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-11-15 22:00:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-15 22:00:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2019-11-15 22:00:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 22:00:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2019-11-15 22:00:04,206 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 67 [2019-11-15 22:00:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:00:04,207 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2019-11-15 22:00:04,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:00:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2019-11-15 22:00:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 22:00:04,208 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:00:04,208 INFO L380 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-11-15 22:00:04,209 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:00:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1637067153, now seen corresponding path program 1 times [2019-11-15 22:00:04,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:04,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271634931] [2019-11-15 22:00:04,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:04,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:04,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 22:00:04,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271634931] [2019-11-15 22:00:04,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:00:04,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:00:04,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790851980] [2019-11-15 22:00:04,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:00:04,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:04,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:00:04,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:00:04,392 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 10 states. [2019-11-15 22:00:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:04,924 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2019-11-15 22:00:04,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:00:04,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-11-15 22:00:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:00:04,925 INFO L225 Difference]: With dead ends: 131 [2019-11-15 22:00:04,925 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 22:00:04,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:00:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 22:00:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 110. [2019-11-15 22:00:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:00:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-15 22:00:04,930 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 86 [2019-11-15 22:00:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:00:04,930 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-15 22:00:04,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:00:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-15 22:00:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 22:00:04,931 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:00:04,932 INFO L380 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-11-15 22:00:04,932 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:00:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1637067152, now seen corresponding path program 1 times [2019-11-15 22:00:04,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:04,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493974115] [2019-11-15 22:00:04,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:04,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:04,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 22:00:05,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493974115] [2019-11-15 22:00:05,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:00:05,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 22:00:05,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819359535] [2019-11-15 22:00:05,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:00:05,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:05,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:00:05,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:00:05,293 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 15 states. [2019-11-15 22:00:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:06,023 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-11-15 22:00:06,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:00:06,023 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-11-15 22:00:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:00:06,024 INFO L225 Difference]: With dead ends: 121 [2019-11-15 22:00:06,025 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 22:00:06,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:00:06,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 22:00:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 108. [2019-11-15 22:00:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 22:00:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2019-11-15 22:00:06,029 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 86 [2019-11-15 22:00:06,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:00:06,029 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2019-11-15 22:00:06,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:00:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2019-11-15 22:00:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:00:06,030 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:00:06,031 INFO L380 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-11-15 22:00:06,031 INFO L410 AbstractCegarLoop]: === Iteration 26 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:00:06,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:06,031 INFO L82 PathProgramCache]: Analyzing trace with hash -513843116, now seen corresponding path program 1 times [2019-11-15 22:00:06,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:06,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153159756] [2019-11-15 22:00:06,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:06,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:06,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 22:00:06,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153159756] [2019-11-15 22:00:06,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492084756] [2019-11-15 22:00:06,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 22:00:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:06,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 22:00:06,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:06,543 INFO L375 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-11-15 22:00:06,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:06,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:06,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:06,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-11-15 22:00:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 22:00:06,560 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:00:06,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-11-15 22:00:06,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333003111] [2019-11-15 22:00:06,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:00:06,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:06,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:00:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:00:06,562 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 15 states. [2019-11-15 22:00:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:07,429 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-11-15 22:00:07,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:00:07,430 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2019-11-15 22:00:07,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:00:07,431 INFO L225 Difference]: With dead ends: 125 [2019-11-15 22:00:07,431 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 22:00:07,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:00:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 22:00:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2019-11-15 22:00:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 22:00:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-15 22:00:07,435 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 89 [2019-11-15 22:00:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:00:07,436 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-15 22:00:07,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:00:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-15 22:00:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:00:07,437 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:00:07,437 INFO L380 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-11-15 22:00:07,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:00:07,642 INFO L410 AbstractCegarLoop]: === Iteration 27 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:00:07,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:07,642 INFO L82 PathProgramCache]: Analyzing trace with hash -513843115, now seen corresponding path program 1 times [2019-11-15 22:00:07,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:07,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190526526] [2019-11-15 22:00:07,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:07,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:07,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 22:00:09,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190526526] [2019-11-15 22:00:09,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648019674] [2019-11-15 22:00:09,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 22:00:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:09,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 121 conjunts are in the unsatisfiable core [2019-11-15 22:00:09,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:09,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:09,456 INFO L375 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-11-15 22:00:09,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:09,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:09,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:09,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 22:00:09,469 INFO L375 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-11-15 22:00:09,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:09,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:09,492 INFO L375 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-11-15 22:00:09,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:09,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:09,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:09,501 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-15 22:00:09,578 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:09,579 INFO L375 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-11-15 22:00:09,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:00:09,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:09,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:00:09,611 INFO L567 ElimStorePlain]: treesize reduction 44, result has 53.2 percent of original size [2019-11-15 22:00:09,616 INFO L375 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 46 treesize of output 41 [2019-11-15 22:00:09,616 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:09,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:09,628 INFO L496 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-11-15 22:00:09,628 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2019-11-15 22:00:11,124 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-11-15 22:00:11,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:00:11,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:00:11,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:11,144 INFO L375 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 1 case distinctions, treesize of input 50 treesize of output 59 [2019-11-15 22:00:11,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:11,173 INFO L567 ElimStorePlain]: treesize reduction 28, result has 62.7 percent of original size [2019-11-15 22:00:11,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:11,183 INFO L375 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 37 treesize of output 36 [2019-11-15 22:00:11,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:11,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:11,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:11,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:11,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:11,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:11,187 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:00:11,215 INFO L567 ElimStorePlain]: treesize reduction 12, result has 70.0 percent of original size [2019-11-15 22:00:11,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:11,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:11,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:11 [2019-11-15 22:00:12,348 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) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (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|))) is different from true [2019-11-15 22:00:12,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:00:12,356 INFO L375 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 11 [2019-11-15 22:00:12,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:12,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:12,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:12,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:11 [2019-11-15 22:00:13,170 INFO L375 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-11-15 22:00:13,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:13,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:13,179 INFO L375 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-11-15 22:00:13,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:13,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:13,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:13,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2019-11-15 22:00:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-11-15 22:00:13,331 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:00:13,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38] total 62 [2019-11-15 22:00:13,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059310613] [2019-11-15 22:00:13,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-11-15 22:00:13,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:13,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-11-15 22:00:13,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3452, Unknown=2, NotChecked=238, Total=3906 [2019-11-15 22:00:13,333 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 63 states. [2019-11-15 22:00:17,868 WARN L191 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-11-15 22:00:20,171 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2019-11-15 22:00:21,417 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-15 22:00:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:23,099 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2019-11-15 22:00:23,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-15 22:00:23,099 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 89 [2019-11-15 22:00:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:00:23,100 INFO L225 Difference]: With dead ends: 125 [2019-11-15 22:00:23,101 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 22:00:23,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1866 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=685, Invalid=8063, Unknown=2, NotChecked=370, Total=9120 [2019-11-15 22:00:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 22:00:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2019-11-15 22:00:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:00:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2019-11-15 22:00:23,108 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 89 [2019-11-15 22:00:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:00:23,108 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2019-11-15 22:00:23,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-11-15 22:00:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2019-11-15 22:00:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:00:23,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:00:23,110 INFO L380 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-11-15 22:00:23,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:00:23,314 INFO L410 AbstractCegarLoop]: === Iteration 28 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:00:23,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:23,314 INFO L82 PathProgramCache]: Analyzing trace with hash -481310733, now seen corresponding path program 1 times [2019-11-15 22:00:23,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:23,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294572672] [2019-11-15 22:00:23,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:23,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:23,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 22:00:23,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294572672] [2019-11-15 22:00:23,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:00:23,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-15 22:00:23,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605271588] [2019-11-15 22:00:23,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:00:23,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:23,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:00:23,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:00:23,636 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 16 states. [2019-11-15 22:00:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:24,336 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2019-11-15 22:00:24,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:00:24,337 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-11-15 22:00:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:00:24,338 INFO L225 Difference]: With dead ends: 116 [2019-11-15 22:00:24,338 INFO L226 Difference]: Without dead ends: 114 [2019-11-15 22:00:24,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:00:24,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-15 22:00:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-15 22:00:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:00:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2019-11-15 22:00:24,343 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 89 [2019-11-15 22:00:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:00:24,343 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2019-11-15 22:00:24,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:00:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2019-11-15 22:00:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 22:00:24,345 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:00:24,345 INFO L380 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-11-15 22:00:24,345 INFO L410 AbstractCegarLoop]: === Iteration 29 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:00:24,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1250731190, now seen corresponding path program 1 times [2019-11-15 22:00:24,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:24,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259433072] [2019-11-15 22:00:24,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:24,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:24,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 22:00:24,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259433072] [2019-11-15 22:00:24,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:00:24,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 22:00:24,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833488682] [2019-11-15 22:00:24,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:00:24,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:00:24,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:00:24,671 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand 15 states. [2019-11-15 22:00:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:25,507 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2019-11-15 22:00:25,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:00:25,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-11-15 22:00:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:00:25,509 INFO L225 Difference]: With dead ends: 112 [2019-11-15 22:00:25,509 INFO L226 Difference]: Without dead ends: 112 [2019-11-15 22:00:25,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:00:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-15 22:00:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2019-11-15 22:00:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 22:00:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-11-15 22:00:25,514 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 90 [2019-11-15 22:00:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:00:25,514 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-11-15 22:00:25,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:00:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-11-15 22:00:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:00:25,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:00:25,516 INFO L380 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-11-15 22:00:25,516 INFO L410 AbstractCegarLoop]: === Iteration 30 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:00:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash -636747301, now seen corresponding path program 1 times [2019-11-15 22:00:25,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:25,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532548374] [2019-11-15 22:00:25,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:25,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:25,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:00:26,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532548374] [2019-11-15 22:00:26,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573385207] [2019-11-15 22:00:26,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 22:00:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:26,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 90 conjunts are in the unsatisfiable core [2019-11-15 22:00:26,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:26,938 INFO L375 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-11-15 22:00:26,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:26,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:26,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:26,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 22:00:27,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:27,058 INFO L375 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-11-15 22:00:27,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:27,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:27,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:27,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-11-15 22:00:27,157 INFO L375 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-11-15 22:00:27,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:27,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:27,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:27,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-15 22:00:27,286 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:27,287 INFO L375 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-11-15 22:00:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:00:27,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:27,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:00:27,305 INFO L567 ElimStorePlain]: treesize reduction 34, result has 46.0 percent of original size [2019-11-15 22:00:27,306 INFO L496 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-11-15 22:00:27,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-11-15 22:00:27,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:27,562 INFO L375 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-11-15 22:00:27,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:27,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:27,563 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:00:27,576 INFO L567 ElimStorePlain]: treesize reduction 12, result has 52.0 percent of original size [2019-11-15 22:00:27,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:27,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2019-11-15 22:00:29,314 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-11-15 22:00:29,356 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:29,357 INFO L375 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-11-15 22:00:29,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:29,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:29,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:29,383 INFO L567 ElimStorePlain]: treesize reduction 72, result has 32.7 percent of original size [2019-11-15 22:00:29,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:29,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:18 [2019-11-15 22:00:29,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-11-15 22:00:29,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:29,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:29,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:29,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-15 22:00:30,512 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-11-15 22:00:30,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:00:30,524 INFO L375 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 37 treesize of output 17 [2019-11-15 22:00:30,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:30,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:30,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:18 [2019-11-15 22:00:31,327 INFO L375 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-11-15 22:00:31,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:00:31,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:31,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:31,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-11-15 22:00:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2019-11-15 22:00:31,382 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:00:31,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 52 [2019-11-15 22:00:31,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780019162] [2019-11-15 22:00:31,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-11-15 22:00:31,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:00:31,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-11-15 22:00:31,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2392, Unknown=2, NotChecked=198, Total=2756 [2019-11-15 22:00:31,385 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 53 states. [2019-11-15 22:00:35,842 WARN L191 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-15 22:00:39,688 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-15 22:00:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:00:43,161 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2019-11-15 22:00:43,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 22:00:43,162 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 92 [2019-11-15 22:00:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:00:43,163 INFO L225 Difference]: With dead ends: 117 [2019-11-15 22:00:43,163 INFO L226 Difference]: Without dead ends: 117 [2019-11-15 22:00:43,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=463, Invalid=5093, Unknown=2, NotChecked=294, Total=5852 [2019-11-15 22:00:43,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-15 22:00:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2019-11-15 22:00:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:00:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2019-11-15 22:00:43,169 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 92 [2019-11-15 22:00:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:00:43,169 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2019-11-15 22:00:43,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-11-15 22:00:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2019-11-15 22:00:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:00:43,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:00:43,171 INFO L380 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-11-15 22:00:43,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:00:43,372 INFO L410 AbstractCegarLoop]: === Iteration 31 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:00:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:00:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2028921689, now seen corresponding path program 1 times [2019-11-15 22:00:43,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:00:43,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398937079] [2019-11-15 22:00:43,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:43,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:00:43,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:00:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 22:00:44,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398937079] [2019-11-15 22:00:44,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994070936] [2019-11-15 22:00:44,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 22:00:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:00:44,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 95 conjunts are in the unsatisfiable core [2019-11-15 22:00:44,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:00:44,855 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:44,855 INFO L375 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-11-15 22:00:44,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:44,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:44,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:44,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 22:00:44,935 INFO L375 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-11-15 22:00:44,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:44,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:44,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:44,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-15 22:00:45,036 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:45,036 INFO L375 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-11-15 22:00:45,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:00:45,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:45,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:45,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:00:45,057 INFO L567 ElimStorePlain]: treesize reduction 25, result has 49.0 percent of original size [2019-11-15 22:00:45,057 INFO L496 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-11-15 22:00:45,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-11-15 22:00:46,990 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-11-15 22:00:47,129 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 22:00:47,129 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:47,130 INFO L375 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-11-15 22:00:47,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:47,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:47,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:47,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:00:47,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:00:47,198 INFO L567 ElimStorePlain]: treesize reduction 304, result has 9.0 percent of original size [2019-11-15 22:00:47,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:47,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:12 [2019-11-15 22:00:47,958 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-11-15 22:00:47,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:00:47,972 INFO L375 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 28 treesize of output 12 [2019-11-15 22:00:47,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:00:47,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:00:47,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:00:47,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:12 [2019-11-15 22:00:49,982 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_23 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_23) 0) v_main_~s~0.base_BEFORE_CALL_23))) is different from true [2019-11-15 22:00:52,060 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_24 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_24 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_24) 0)))) is different from true [2019-11-15 22:00:54,107 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_25 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_25 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_25) 0)))) is different from true [2019-11-15 22:01:06,159 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 22:01:08,257 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-15 22:01:10,314 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-15 22:01:12,369 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 22:01:14,439 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-15 22:01:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 9 not checked. [2019-11-15 22:01:14,464 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:01:14,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 56 [2019-11-15 22:01:14,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847903270] [2019-11-15 22:01:14,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-11-15 22:01:14,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:14,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-11-15 22:01:14,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2399, Unknown=10, NotChecked=510, Total=3080 [2019-11-15 22:01:14,466 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 56 states. [2019-11-15 22:01:18,493 WARN L191 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-15 22:01:20,343 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-15 22:01:29,001 WARN L191 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-15 22:01:37,633 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 22:01:38,027 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 22:01:38,393 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 22:01:39,075 WARN L191 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-15 22:01:39,837 WARN L191 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-11-15 22:01:40,548 WARN L191 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-11-15 22:01:40,943 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-11-15 22:01:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:01:41,168 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-11-15 22:01:41,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 22:01:41,169 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 95 [2019-11-15 22:01:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:01:41,170 INFO L225 Difference]: With dead ends: 113 [2019-11-15 22:01:41,170 INFO L226 Difference]: Without dead ends: 108 [2019-11-15 22:01:41,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 55.2s TimeCoverageRelationStatistics Valid=424, Invalid=4694, Unknown=14, NotChecked=720, Total=5852 [2019-11-15 22:01:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-15 22:01:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-11-15 22:01:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 22:01:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-11-15 22:01:41,174 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 95 [2019-11-15 22:01:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:01:41,175 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-11-15 22:01:41,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-11-15 22:01:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-11-15 22:01:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:01:41,176 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:01:41,176 INFO L380 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-11-15 22:01:41,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:01:41,377 INFO L410 AbstractCegarLoop]: === Iteration 32 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:01:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:01:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1531846009, now seen corresponding path program 1 times [2019-11-15 22:01:41,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:01:41,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005833938] [2019-11-15 22:01:41,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:41,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:01:41,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:01:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 22:01:43,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005833938] [2019-11-15 22:01:43,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305883403] [2019-11-15 22:01:43,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 22:01:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:01:43,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 123 conjunts are in the unsatisfiable core [2019-11-15 22:01:43,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:01:44,014 INFO L375 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-11-15 22:01:44,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:44,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:44,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:01:44,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-15 22:01:44,124 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_35|], 1=[|v_#memory_$Pointer$.base_46|]} [2019-11-15 22:01:44,127 INFO L375 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 11 [2019-11-15 22:01:44,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:44,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:44,145 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:44,146 INFO L375 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 31 treesize of output 41 [2019-11-15 22:01:44,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:44,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:44,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:44,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:01:44,168 INFO L567 ElimStorePlain]: treesize reduction 56, result has 32.5 percent of original size [2019-11-15 22:01:44,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:01:44,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:26 [2019-11-15 22:01:46,142 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-11-15 22:01:46,145 INFO L392 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_56|], 11=[|v_#memory_$Pointer$.base_BEFORE_CALL_20|]} [2019-11-15 22:01:46,210 INFO L341 Elim1Store]: treesize reduction 72, result has 48.2 percent of original size [2019-11-15 22:01:46,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 76 [2019-11-15 22:01:46,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:46,302 INFO L567 ElimStorePlain]: treesize reduction 44, result has 67.4 percent of original size [2019-11-15 22:01:46,430 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-15 22:01:46,431 INFO L341 Elim1Store]: treesize reduction 8, result has 94.4 percent of original size [2019-11-15 22:01:46,431 INFO L375 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 88 treesize of output 196 [2019-11-15 22:01:46,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:01:46,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:01:46,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:01:46,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:01:46,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:01:46,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:01:46,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:46,467 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 22:01:46,739 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 32 [2019-11-15 22:01:46,740 INFO L567 ElimStorePlain]: treesize reduction 3869, result has 2.3 percent of original size [2019-11-15 22:01:46,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:01:46,741 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:75 [2019-11-15 22:01:48,208 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-11-15 22:01:48,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:48,216 INFO L392 ElimStorePlain]: Different costs {5=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_57|], 6=[|v_#memory_$Pointer$.offset_BEFORE_CALL_13|]} [2019-11-15 22:01:48,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:01:48,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:48,241 INFO L375 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 67 treesize of output 61 [2019-11-15 22:01:48,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:48,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:01:48,254 INFO L375 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 62 treesize of output 46 [2019-11-15 22:01:48,255 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:48,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:48,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:01:48,290 INFO L375 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 43 treesize of output 27 [2019-11-15 22:01:48,291 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:48,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:01:48,297 INFO L375 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 48 treesize of output 32 [2019-11-15 22:01:48,298 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:48,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:48,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:01:48,316 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:130, output treesize:48 [2019-11-15 22:01:48,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:49,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:49,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:49,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:49,612 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 11=[|#memory_$Pointer$.base|]} [2019-11-15 22:01:49,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:01:49,628 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:49,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 54 [2019-11-15 22:01:49,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:49,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:49,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:01:49,634 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:01:49,635 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:01:49,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:01:49,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2019-11-15 22:01:49,649 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:49,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:01:49,659 INFO L375 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 0 case distinctions, treesize of input 57 treesize of output 41 [2019-11-15 22:01:49,659 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:49,665 INFO L375 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 61 treesize of output 45 [2019-11-15 22:01:49,665 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:49,734 INFO L567 ElimStorePlain]: treesize reduction 78, result has 51.2 percent of original size [2019-11-15 22:01:49,739 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:01:49,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:49,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 35 [2019-11-15 22:01:49,747 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:49,751 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:01:49,780 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-11-15 22:01:49,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 53 [2019-11-15 22:01:49,781 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 22:01:49,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:01:49,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:01:49,796 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:247, output treesize:25 [2019-11-15 22:01:49,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:01:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 2 not checked. [2019-11-15 22:01:50,134 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:01:50,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 66 [2019-11-15 22:01:50,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446532155] [2019-11-15 22:01:50,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-11-15 22:01:50,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:01:50,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-11-15 22:01:50,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3830, Unknown=2, NotChecked=250, Total=4290 [2019-11-15 22:01:50,136 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 66 states. [2019-11-15 22:01:55,918 WARN L191 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2019-11-15 22:01:59,996 WARN L191 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2019-11-15 22:02:01,799 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-11-15 22:02:02,087 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-11-15 22:02:02,359 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-15 22:02:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:02,532 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-11-15 22:02:02,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 22:02:02,532 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 95 [2019-11-15 22:02:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:02,533 INFO L225 Difference]: With dead ends: 103 [2019-11-15 22:02:02,533 INFO L226 Difference]: Without dead ends: 103 [2019-11-15 22:02:02,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=548, Invalid=7114, Unknown=2, NotChecked=346, Total=8010 [2019-11-15 22:02:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-15 22:02:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-11-15 22:02:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 22:02:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2019-11-15 22:02:02,538 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 95 [2019-11-15 22:02:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:02,539 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2019-11-15 22:02:02,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-11-15 22:02:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2019-11-15 22:02:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:02:02,540 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:02,540 INFO L380 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-11-15 22:02:02,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:02,744 INFO L410 AbstractCegarLoop]: === Iteration 33 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:02:02,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:02,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1069811063, now seen corresponding path program 1 times [2019-11-15 22:02:02,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:02,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292198628] [2019-11-15 22:02:02,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:02,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:02,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 22:02:04,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292198628] [2019-11-15 22:02:04,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171344556] [2019-11-15 22:02:04,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 22:02:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:04,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:02:04,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:04,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:04,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:04,468 INFO L375 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 19 treesize of output 21 [2019-11-15 22:02:04,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:04,493 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:04,494 INFO L375 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 18 treesize of output 34 [2019-11-15 22:02:04,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:04,558 INFO L567 ElimStorePlain]: treesize reduction 23, result has 54.0 percent of original size [2019-11-15 22:02:04,559 INFO L496 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-11-15 22:02:04,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:24 [2019-11-15 22:02:04,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 22:02:04,691 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:02:04,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7] total 39 [2019-11-15 22:02:04,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244200654] [2019-11-15 22:02:04,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 22:02:04,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:02:04,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 22:02:04,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:02:04,693 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 40 states. [2019-11-15 22:02:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:02:06,879 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2019-11-15 22:02:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 22:02:06,880 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 97 [2019-11-15 22:02:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:02:06,881 INFO L225 Difference]: With dead ends: 98 [2019-11-15 22:02:06,881 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 22:02:06,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=316, Invalid=3224, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 22:02:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 22:02:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-15 22:02:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 22:02:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2019-11-15 22:02:06,884 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 97 [2019-11-15 22:02:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:02:06,884 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2019-11-15 22:02:06,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 22:02:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2019-11-15 22:02:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 22:02:06,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:02:06,886 INFO L380 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-11-15 22:02:07,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:02:07,086 INFO L410 AbstractCegarLoop]: === Iteration 34 === [sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 22:02:07,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:02:07,087 INFO L82 PathProgramCache]: Analyzing trace with hash -175855092, now seen corresponding path program 1 times [2019-11-15 22:02:07,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:02:07,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845618223] [2019-11-15 22:02:07,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:07,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:02:07,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:02:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-15 22:02:08,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845618223] [2019-11-15 22:02:08,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460200575] [2019-11-15 22:02:08,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/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-11-15 22:02:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:02:08,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 118 conjunts are in the unsatisfiable core [2019-11-15 22:02:08,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:02:09,242 INFO L375 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-11-15 22:02:09,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:09,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:09,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:02:09,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-11-15 22:02:09,412 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:02:09,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:09,422 INFO L375 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 56 [2019-11-15 22:02:09,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:09,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:09,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:09,456 INFO L496 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-11-15 22:02:09,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:58 [2019-11-15 22:02:10,035 INFO L341 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2019-11-15 22:02:10,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2019-11-15 22:02:10,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:10,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:10,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:02:10,063 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:10,063 INFO L375 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 24 [2019-11-15 22:02:10,063 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:02:10,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:10,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:02:10,077 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:18 [2019-11-15 22:02:21,866 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 22:02:21,873 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:02:21,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:21,915 INFO L375 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 77 treesize of output 126 [2019-11-15 22:02:21,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:21,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:21,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:21,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:21,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:21,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:02:21,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:21,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:21,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:21,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-15 22:02:22,032 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-11-15 22:02:22,032 INFO L567 ElimStorePlain]: treesize reduction 393, result has 22.6 percent of original size [2019-11-15 22:02:22,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:02:22,035 INFO L496 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-11-15 22:02:22,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:103, output treesize:109 [2019-11-15 22:02:22,181 INFO L341 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2019-11-15 22:02:22,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2019-11-15 22:02:22,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:22,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:22,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-11-15 22:02:22,197 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:02:22,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:22,208 INFO L496 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-11-15 22:02:22,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-11-15 22:02:34,524 WARN L191 SmtUtils]: Spent 851.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 22:02:34,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:02:34,562 INFO L375 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 54 treesize of output 30 [2019-11-15 22:02:34,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:34,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:34,581 INFO L496 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-11-15 22:02:34,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:55 [2019-11-15 22:02:34,689 INFO L341 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2019-11-15 22:02:34,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2019-11-15 22:02:34,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:34,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:34,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:02:34,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2019-11-15 22:02:34,979 INFO L341 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2019-11-15 22:02:34,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2019-11-15 22:02:34,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:34,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:34,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:02:34,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2019-11-15 22:02:35,076 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:35,077 INFO L375 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-11-15 22:02:35,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:02:35,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:02:35,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:02:35,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 [2019-11-15 22:02:49,152 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 16 [2019-11-15 22:02:57,221 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2019-11-15 22:02:59,301 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-11-15 22:03:01,385 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-11-15 22:03:03,470 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2019-11-15 22:03:05,564 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-15 22:03:07,678 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-15 22:03:07,684 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:03:07,685 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:03:07,698 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-15 22:03:07,698 INFO L375 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 3 case distinctions, treesize of input 53 treesize of output 44 [2019-11-15 22:03:07,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:03:07,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:03:07,700 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:03:07,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:03:07,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:03:07,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 22:03:07,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:71, output treesize:59 [2019-11-15 22:03:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 22:03:09,943 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:03:09,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2019-11-15 22:03:09,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671079992] [2019-11-15 22:03:09,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-15 22:03:09,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:03:09,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-15 22:03:09,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3905, Unknown=28, NotChecked=0, Total=4160 [2019-11-15 22:03:09,945 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 65 states. [2019-11-15 22:03:33,791 WARN L191 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 22:03:40,782 WARN L191 SmtUtils]: Spent 770.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 22:03:45,892 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-15 22:03:48,021 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 22:03:50,145 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-15 22:03:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:03:50,353 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-11-15 22:03:50,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 22:03:50,353 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 101 [2019-11-15 22:03:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:03:50,354 INFO L225 Difference]: With dead ends: 97 [2019-11-15 22:03:50,354 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:03:50,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 77.7s TimeCoverageRelationStatistics Valid=481, Invalid=6628, Unknown=31, NotChecked=0, Total=7140 [2019-11-15 22:03:50,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:03:50,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:03:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:03:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:03:50,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2019-11-15 22:03:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:03:50,355 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:03:50,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-15 22:03:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:03:50,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:03:50,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:03:50,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:03:50 BoogieIcfgContainer [2019-11-15 22:03:50,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:03:50,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:03:50,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:03:50,564 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:03:50,576 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:58:07" (3/4) ... [2019-11-15 22:03:50,580 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:03:50,587 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 22:03:50,588 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-15 22:03:50,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_get_data_at [2019-11-15 22:03:50,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-15 22:03:50,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-15 22:03:50,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2019-11-15 22:03:50,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_destroy [2019-11-15 22:03:50,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 22:03:50,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_update_at [2019-11-15 22:03:50,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-11-15 22:03:50,597 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-11-15 22:03:50,598 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-15 22:03:50,598 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 22:03:50,658 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d64a4958-6f98-4e31-9ace-87eeda926fa3/bin/uautomizer/witness.graphml [2019-11-15 22:03:50,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:03:50,660 INFO L168 Benchmark]: Toolchain (without parser) took 344194.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -285.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:50,660 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:03:50,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:50,661 INFO L168 Benchmark]: Boogie Preprocessor took 69.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:50,661 INFO L168 Benchmark]: RCFGBuilder took 633.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:50,662 INFO L168 Benchmark]: TraceAbstraction took 342855.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -188.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:03:50,662 INFO L168 Benchmark]: Witness Printer took 94.93 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:03:50,664 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 535.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 633.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 342855.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -188.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 94.93 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 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: 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: 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: 592]: 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: 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: 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: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 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: 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: 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 27 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 110 locations, 27 error locations. Result: SAFE, OverallTime: 342.8s, OverallIterations: 34, TraceHistogramMax: 3, AutomataDifference: 169.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2059 SDtfs, 5705 SDslu, 10570 SDs, 0 SdLazy, 38047 SolverSat, 1302 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 83.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2271 GetRequests, 1143 SyntacticMatches, 29 SemanticMatches, 1099 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 10623 ImplicationChecksByTransitivity, 240.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 633 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 165.5s InterpolantComputationTime, 3077 NumberOfCodeBlocks, 3067 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3027 ConstructedInterpolants, 216 QuantifiedInterpolants, 2340401 SizeOfPredicates, 271 NumberOfNonLiveVariables, 5277 ConjunctsInSsa, 991 ConjunctsInUnsatCore, 50 InterpolantComputations, 19 PerfectInterpolantSequences, 720/1044 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! Received shutdown request...