./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_remove_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/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 a3189d7d4e71631c5441bd903e5049703e07b8be ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:44:09,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:44:09,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:44:09,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:44:09,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:44:09,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:44:09,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:44:09,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:44:09,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:44:09,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:44:09,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:44:09,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:44:09,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:44:09,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:44:09,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:44:09,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:44:09,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:44:09,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:44:09,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:44:09,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:44:09,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:44:09,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:44:09,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:44:09,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:44:09,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:44:09,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:44:09,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:44:09,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:44:09,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:44:09,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:44:09,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:44:09,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:44:09,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:44:09,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:44:09,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:44:09,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:44:09,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:44:09,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:44:09,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:44:09,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:44:09,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:44:09,950 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 17:44:09,959 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:44:09,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:44:09,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:44:09,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:44:09,960 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:44:09,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:44:09,961 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:44:09,961 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:44:09,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:44:09,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:44:09,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:44:09,962 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:44:09,962 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:44:09,962 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 17:44:09,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:44:09,962 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:44:09,962 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:44:09,962 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:44:09,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:44:09,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:44:09,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:44:09,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:44:09,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:44:09,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:44:09,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:44:09,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:44:09,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:44:09,964 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:44:09,964 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_e2f457f9-80d4-4747-a4b8-487ea84698e0/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 -> a3189d7d4e71631c5441bd903e5049703e07b8be [2019-12-07 17:44:10,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:44:10,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:44:10,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:44:10,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:44:10,075 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:44:10,076 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_remove_all.i [2019-12-07 17:44:10,118 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/data/76bff3d57/8aeefc6705b04980b7cadb37c26ac17a/FLAGffd94c807 [2019-12-07 17:44:10,579 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:44:10,579 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/sv-benchmarks/c/list-simple/sll2n_remove_all.i [2019-12-07 17:44:10,588 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/data/76bff3d57/8aeefc6705b04980b7cadb37c26ac17a/FLAGffd94c807 [2019-12-07 17:44:11,094 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/data/76bff3d57/8aeefc6705b04980b7cadb37c26ac17a [2019-12-07 17:44:11,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:44:11,097 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:44:11,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:44:11,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:44:11,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:44:11,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:44:11" (1/1) ... [2019-12-07 17:44:11,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@542f2740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:11, skipping insertion in model container [2019-12-07 17:44:11,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:44:11" (1/1) ... [2019-12-07 17:44:11,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:44:11,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:44:11,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:44:11,351 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:44:11,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:44:11,412 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:44:11,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:11 WrapperNode [2019-12-07 17:44:11,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:44:11,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:44:11,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:44:11,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:44:11,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:11" (1/1) ... [2019-12-07 17:44:11,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:11" (1/1) ... [2019-12-07 17:44:11,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:11" (1/1) ... [2019-12-07 17:44:11,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:11" (1/1) ... [2019-12-07 17:44:11,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:11" (1/1) ... [2019-12-07 17:44:11,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:11" (1/1) ... [2019-12-07 17:44:11,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:11" (1/1) ... [2019-12-07 17:44:11,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:44:11,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:44:11,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:44:11,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:44:11,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:44:11,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 17:44:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:44:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 17:44:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 17:44:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 17:44:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-12-07 17:44:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-12-07 17:44:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_first [2019-12-07 17:44:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 17:44:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 17:44:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 17:44:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 17:44:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 17:44:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 17:44:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 17:44:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 17:44:11,495 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 17:44:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 17:44:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 17:44:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_first [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:44:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:44:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 17:44:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:44:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 17:44:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 17:44:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:44:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:44:11,662 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 17:44:11,768 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:44:11,768 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-12-07 17:44:11,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:44:11 BoogieIcfgContainer [2019-12-07 17:44:11,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:44:11,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:44:11,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:44:11,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:44:11,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:44:11" (1/3) ... [2019-12-07 17:44:11,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3006aeeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:44:11, skipping insertion in model container [2019-12-07 17:44:11,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:44:11" (2/3) ... [2019-12-07 17:44:11,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3006aeeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:44:11, skipping insertion in model container [2019-12-07 17:44:11,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:44:11" (3/3) ... [2019-12-07 17:44:11,774 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all.i [2019-12-07 17:44:11,780 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:44:11,785 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-12-07 17:44:11,792 INFO L249 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-12-07 17:44:11,805 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:44:11,805 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 17:44:11,805 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:44:11,805 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:44:11,805 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:44:11,805 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:44:11,805 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:44:11,805 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:44:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-12-07 17:44:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:44:11,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:11,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:11,824 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1239761964, now seen corresponding path program 1 times [2019-12-07 17:44:11,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:11,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157128325] [2019-12-07 17:44:11,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:11,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157128325] [2019-12-07 17:44:11,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:11,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:44:11,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144801057] [2019-12-07 17:44:11,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:44:11,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:11,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:44:11,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:44:11,979 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-12-07 17:44:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:12,114 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-12-07 17:44:12,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:44:12,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:44:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:12,122 INFO L225 Difference]: With dead ends: 73 [2019-12-07 17:44:12,123 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 17:44:12,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:44:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 17:44:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-12-07 17:44:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 17:44:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-12-07 17:44:12,153 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 13 [2019-12-07 17:44:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:12,154 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-12-07 17:44:12,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:44:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-12-07 17:44:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:44:12,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:12,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:12,155 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:12,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:12,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1239761965, now seen corresponding path program 1 times [2019-12-07 17:44:12,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:12,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649841601] [2019-12-07 17:44:12,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:12,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649841601] [2019-12-07 17:44:12,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:12,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:44:12,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689557707] [2019-12-07 17:44:12,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:44:12,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:12,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:44:12,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:44:12,213 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 4 states. [2019-12-07 17:44:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:12,295 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2019-12-07 17:44:12,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:44:12,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:44:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:12,297 INFO L225 Difference]: With dead ends: 65 [2019-12-07 17:44:12,297 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 17:44:12,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:44:12,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 17:44:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-12-07 17:44:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 17:44:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-12-07 17:44:12,305 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 13 [2019-12-07 17:44:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:12,305 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-12-07 17:44:12,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:44:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-12-07 17:44:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:44:12,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:12,306 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:12,306 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:12,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:12,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2079313793, now seen corresponding path program 1 times [2019-12-07 17:44:12,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:12,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827348122] [2019-12-07 17:44:12,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:12,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827348122] [2019-12-07 17:44:12,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:12,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:44:12,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621956282] [2019-12-07 17:44:12,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:44:12,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:12,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:44:12,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:44:12,367 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 6 states. [2019-12-07 17:44:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:12,502 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-12-07 17:44:12,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:44:12,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 17:44:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:12,504 INFO L225 Difference]: With dead ends: 68 [2019-12-07 17:44:12,504 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 17:44:12,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:44:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 17:44:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2019-12-07 17:44:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 17:44:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-12-07 17:44:12,510 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 15 [2019-12-07 17:44:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:12,510 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-12-07 17:44:12,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:44:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-12-07 17:44:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:44:12,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:12,511 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:12,511 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1060865836, now seen corresponding path program 1 times [2019-12-07 17:44:12,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:12,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860752799] [2019-12-07 17:44:12,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:12,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860752799] [2019-12-07 17:44:12,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:12,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:44:12,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561756474] [2019-12-07 17:44:12,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:44:12,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:12,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:44:12,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:44:12,586 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 8 states. [2019-12-07 17:44:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:12,805 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-12-07 17:44:12,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:44:12,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 17:44:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:12,806 INFO L225 Difference]: With dead ends: 83 [2019-12-07 17:44:12,807 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 17:44:12,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:44:12,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 17:44:12,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2019-12-07 17:44:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 17:44:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-12-07 17:44:12,813 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 17 [2019-12-07 17:44:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:12,813 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-12-07 17:44:12,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:44:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-12-07 17:44:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:44:12,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:12,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:12,814 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:12,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:12,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1060865837, now seen corresponding path program 1 times [2019-12-07 17:44:12,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:12,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303734249] [2019-12-07 17:44:12,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:12,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303734249] [2019-12-07 17:44:12,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:12,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:44:12,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470620595] [2019-12-07 17:44:12,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:44:12,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:12,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:44:12,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:44:12,872 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 7 states. [2019-12-07 17:44:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:13,010 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-12-07 17:44:13,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:44:13,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 17:44:13,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:13,011 INFO L225 Difference]: With dead ends: 71 [2019-12-07 17:44:13,011 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 17:44:13,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:44:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 17:44:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2019-12-07 17:44:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 17:44:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-12-07 17:44:13,015 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 17 [2019-12-07 17:44:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:13,016 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-12-07 17:44:13,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:44:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-12-07 17:44:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:44:13,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:13,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:13,017 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash -616331125, now seen corresponding path program 1 times [2019-12-07 17:44:13,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:13,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115385082] [2019-12-07 17:44:13,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:13,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115385082] [2019-12-07 17:44:13,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:13,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:44:13,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770912315] [2019-12-07 17:44:13,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:44:13,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:13,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:44:13,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:44:13,086 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 8 states. [2019-12-07 17:44:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:13,243 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-12-07 17:44:13,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:44:13,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 17:44:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:13,245 INFO L225 Difference]: With dead ends: 61 [2019-12-07 17:44:13,245 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 17:44:13,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:44:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 17:44:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-12-07 17:44:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 17:44:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-12-07 17:44:13,250 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 19 [2019-12-07 17:44:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:13,251 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-12-07 17:44:13,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:44:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-12-07 17:44:13,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:44:13,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:13,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:13,252 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:13,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:13,252 INFO L82 PathProgramCache]: Analyzing trace with hash -616331124, now seen corresponding path program 1 times [2019-12-07 17:44:13,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:13,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158986393] [2019-12-07 17:44:13,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:13,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158986393] [2019-12-07 17:44:13,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:13,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:44:13,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713315958] [2019-12-07 17:44:13,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:44:13,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:13,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:44:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:44:13,330 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 8 states. [2019-12-07 17:44:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:13,470 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-12-07 17:44:13,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:44:13,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 17:44:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:13,471 INFO L225 Difference]: With dead ends: 60 [2019-12-07 17:44:13,471 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 17:44:13,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:44:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 17:44:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-12-07 17:44:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 17:44:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-12-07 17:44:13,475 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 19 [2019-12-07 17:44:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:13,475 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-12-07 17:44:13,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:44:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-12-07 17:44:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:44:13,476 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:13,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:13,476 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:13,476 INFO L82 PathProgramCache]: Analyzing trace with hash 983751933, now seen corresponding path program 1 times [2019-12-07 17:44:13,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:13,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654287831] [2019-12-07 17:44:13,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:13,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654287831] [2019-12-07 17:44:13,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277795153] [2019-12-07 17:44:13,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:13,634 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:44:13,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:13,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:13,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-12-07 17:44:13,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147011029] [2019-12-07 17:44:13,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:44:13,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:13,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:44:13,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:44:13,669 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 9 states. [2019-12-07 17:44:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:13,821 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-12-07 17:44:13,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:44:13,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-12-07 17:44:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:13,822 INFO L225 Difference]: With dead ends: 73 [2019-12-07 17:44:13,822 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 17:44:13,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:44:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 17:44:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-12-07 17:44:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 17:44:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-12-07 17:44:13,827 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 30 [2019-12-07 17:44:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:13,827 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-12-07 17:44:13,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:44:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-12-07 17:44:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:44:13,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:13,828 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:14,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:14,029 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:14,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1218396876, now seen corresponding path program 2 times [2019-12-07 17:44:14,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:14,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556147214] [2019-12-07 17:44:14,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 17:44:14,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556147214] [2019-12-07 17:44:14,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409090011] [2019-12-07 17:44:14,426 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:14,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:44:14,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:44:14,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 17:44:14,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:14,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:44:14,541 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:14,544 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:14,544 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:14,544 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:44:14,681 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:44:14,705 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 17:44:14,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 31 [2019-12-07 17:44:14,705 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:14,718 INFO L614 ElimStorePlain]: treesize reduction 17, result has 48.5 percent of original size [2019-12-07 17:44:14,719 INFO L534 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-12-07 17:44:14,719 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:16 [2019-12-07 17:44:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:14,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:14,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2019-12-07 17:44:14,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779359365] [2019-12-07 17:44:14,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:44:14,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:14,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:44:14,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:44:14,728 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 18 states. [2019-12-07 17:44:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:15,338 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-12-07 17:44:15,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:44:15,338 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2019-12-07 17:44:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:15,340 INFO L225 Difference]: With dead ends: 94 [2019-12-07 17:44:15,340 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 17:44:15,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:44:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 17:44:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2019-12-07 17:44:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 17:44:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2019-12-07 17:44:15,347 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 43 [2019-12-07 17:44:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:15,347 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2019-12-07 17:44:15,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:44:15,347 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2019-12-07 17:44:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:44:15,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:15,349 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:15,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:15,552 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1218396877, now seen corresponding path program 1 times [2019-12-07 17:44:15,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:15,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594101372] [2019-12-07 17:44:15,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:15,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594101372] [2019-12-07 17:44:15,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287014747] [2019-12-07 17:44:15,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:15,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 17:44:15,935 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:15,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:44:15,939 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:15,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:15,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:15,943 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 17:44:15,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 17:44:15,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:15,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:15,962 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:15,962 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-12-07 17:44:16,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:16,080 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-12-07 17:44:16,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 33 [2019-12-07 17:44:16,080 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:16,096 INFO L614 ElimStorePlain]: treesize reduction 10, result has 73.7 percent of original size [2019-12-07 17:44:16,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:16,098 INFO L534 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-12-07 17:44:16,099 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:28 [2019-12-07 17:44:16,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:16,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:16,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:16,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:44:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:16,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:16,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-12-07 17:44:16,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611307743] [2019-12-07 17:44:16,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 17:44:16,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:16,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 17:44:16,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:44:16,259 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 21 states. [2019-12-07 17:44:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:17,213 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-12-07 17:44:17,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:44:17,214 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2019-12-07 17:44:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:17,215 INFO L225 Difference]: With dead ends: 107 [2019-12-07 17:44:17,215 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 17:44:17,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:44:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 17:44:17,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 94. [2019-12-07 17:44:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 17:44:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2019-12-07 17:44:17,220 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 43 [2019-12-07 17:44:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:17,221 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2019-12-07 17:44:17,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 17:44:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2019-12-07 17:44:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:44:17,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:17,221 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:17,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:17,422 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:17,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:17,423 INFO L82 PathProgramCache]: Analyzing trace with hash -884402456, now seen corresponding path program 1 times [2019-12-07 17:44:17,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:17,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050152648] [2019-12-07 17:44:17,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:44:17,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050152648] [2019-12-07 17:44:17,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:17,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:44:17,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277196478] [2019-12-07 17:44:17,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:44:17,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:17,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:44:17,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:44:17,583 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 15 states. [2019-12-07 17:44:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:17,982 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2019-12-07 17:44:17,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:44:17,983 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2019-12-07 17:44:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:17,984 INFO L225 Difference]: With dead ends: 116 [2019-12-07 17:44:17,984 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 17:44:17,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:44:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 17:44:17,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2019-12-07 17:44:17,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 17:44:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2019-12-07 17:44:17,988 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 44 [2019-12-07 17:44:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:17,989 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-12-07 17:44:17,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:44:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2019-12-07 17:44:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:44:17,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:17,990 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:17,990 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:17,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:17,990 INFO L82 PathProgramCache]: Analyzing trace with hash -884402455, now seen corresponding path program 1 times [2019-12-07 17:44:17,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:17,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459630334] [2019-12-07 17:44:17,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:44:18,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459630334] [2019-12-07 17:44:18,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:18,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 17:44:18,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527073721] [2019-12-07 17:44:18,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:44:18,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:18,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:44:18,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:44:18,178 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand 16 states. [2019-12-07 17:44:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:18,955 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2019-12-07 17:44:18,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:44:18,956 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-12-07 17:44:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:18,958 INFO L225 Difference]: With dead ends: 119 [2019-12-07 17:44:18,958 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 17:44:18,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:44:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 17:44:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2019-12-07 17:44:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 17:44:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2019-12-07 17:44:18,969 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 44 [2019-12-07 17:44:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:18,970 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2019-12-07 17:44:18,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:44:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2019-12-07 17:44:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:44:18,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:18,973 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:18,973 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1904118383, now seen corresponding path program 1 times [2019-12-07 17:44:18,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:18,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253367676] [2019-12-07 17:44:18,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:44:19,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253367676] [2019-12-07 17:44:19,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:19,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:44:19,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801326169] [2019-12-07 17:44:19,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:44:19,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:44:19,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:44:19,113 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand 15 states. [2019-12-07 17:44:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:19,471 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2019-12-07 17:44:19,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:44:19,472 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-12-07 17:44:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:19,472 INFO L225 Difference]: With dead ends: 118 [2019-12-07 17:44:19,473 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 17:44:19,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:44:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 17:44:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2019-12-07 17:44:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 17:44:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2019-12-07 17:44:19,478 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 47 [2019-12-07 17:44:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:19,478 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2019-12-07 17:44:19,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:44:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2019-12-07 17:44:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 17:44:19,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:19,479 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:19,479 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:19,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1101872393, now seen corresponding path program 1 times [2019-12-07 17:44:19,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:19,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804497864] [2019-12-07 17:44:19,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:44:19,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804497864] [2019-12-07 17:44:19,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:19,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:44:19,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948637489] [2019-12-07 17:44:19,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:44:19,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:19,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:44:19,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:44:19,624 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand 15 states. [2019-12-07 17:44:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:20,057 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2019-12-07 17:44:20,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:44:20,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-12-07 17:44:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:20,058 INFO L225 Difference]: With dead ends: 117 [2019-12-07 17:44:20,058 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 17:44:20,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:44:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 17:44:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2019-12-07 17:44:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 17:44:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2019-12-07 17:44:20,062 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 48 [2019-12-07 17:44:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:20,062 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2019-12-07 17:44:20,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:44:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2019-12-07 17:44:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:44:20,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:20,063 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:20,064 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash -201694061, now seen corresponding path program 1 times [2019-12-07 17:44:20,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:20,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418166829] [2019-12-07 17:44:20,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:44:20,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418166829] [2019-12-07 17:44:20,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:20,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:44:20,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419864457] [2019-12-07 17:44:20,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:44:20,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:20,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:44:20,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:44:20,123 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 7 states. [2019-12-07 17:44:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:20,280 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2019-12-07 17:44:20,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:44:20,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 17:44:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:20,281 INFO L225 Difference]: With dead ends: 106 [2019-12-07 17:44:20,281 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 17:44:20,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:44:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 17:44:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-12-07 17:44:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 17:44:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2019-12-07 17:44:20,285 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 49 [2019-12-07 17:44:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:20,285 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2019-12-07 17:44:20,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:44:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2019-12-07 17:44:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:44:20,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:20,287 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:20,287 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:20,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1957548468, now seen corresponding path program 1 times [2019-12-07 17:44:20,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:20,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165873578] [2019-12-07 17:44:20,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:20,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165873578] [2019-12-07 17:44:20,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155507887] [2019-12-07 17:44:20,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:20,691 INFO L264 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:44:20,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:20,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:20,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 17:44:20,796 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:20,800 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:20,800 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:20,800 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-12-07 17:44:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:44:20,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:44:20,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 27 [2019-12-07 17:44:20,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393293035] [2019-12-07 17:44:20,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:44:20,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:20,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:44:20,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:44:20,834 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand 8 states. [2019-12-07 17:44:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:20,964 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2019-12-07 17:44:20,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:44:20,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-12-07 17:44:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:20,965 INFO L225 Difference]: With dead ends: 105 [2019-12-07 17:44:20,965 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 17:44:20,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2019-12-07 17:44:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 17:44:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-12-07 17:44:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 17:44:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-12-07 17:44:20,969 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 50 [2019-12-07 17:44:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:20,970 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-12-07 17:44:20,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:44:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-12-07 17:44:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:44:20,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:20,970 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:21,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:21,171 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:21,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:21,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1133675376, now seen corresponding path program 1 times [2019-12-07 17:44:21,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:21,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124834446] [2019-12-07 17:44:21,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:44:21,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124834446] [2019-12-07 17:44:21,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:21,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:44:21,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350617726] [2019-12-07 17:44:21,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:44:21,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:21,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:44:21,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:44:21,263 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 8 states. [2019-12-07 17:44:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:21,417 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-12-07 17:44:21,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:44:21,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-07 17:44:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:21,418 INFO L225 Difference]: With dead ends: 105 [2019-12-07 17:44:21,418 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 17:44:21,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:44:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 17:44:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-12-07 17:44:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 17:44:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2019-12-07 17:44:21,421 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 55 [2019-12-07 17:44:21,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:21,421 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2019-12-07 17:44:21,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:44:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2019-12-07 17:44:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:44:21,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:21,422 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:21,422 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:21,422 INFO L82 PathProgramCache]: Analyzing trace with hash -150665891, now seen corresponding path program 3 times [2019-12-07 17:44:21,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:21,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704440302] [2019-12-07 17:44:21,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 17:44:21,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704440302] [2019-12-07 17:44:21,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674963752] [2019-12-07 17:44:21,514 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:21,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 17:44:21,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:44:21,604 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:44:21,607 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 17:44:21,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:21,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-12-07 17:44:21,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80236960] [2019-12-07 17:44:21,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:44:21,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:21,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:44:21,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:44:21,621 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 10 states. [2019-12-07 17:44:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:21,764 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-12-07 17:44:21,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:44:21,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 17:44:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:21,765 INFO L225 Difference]: With dead ends: 74 [2019-12-07 17:44:21,765 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 17:44:21,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:44:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 17:44:21,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-12-07 17:44:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 17:44:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-12-07 17:44:21,768 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 56 [2019-12-07 17:44:21,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:21,768 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-12-07 17:44:21,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:44:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-12-07 17:44:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:44:21,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:21,769 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:21,969 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:21,970 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:21,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:21,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1459658098, now seen corresponding path program 1 times [2019-12-07 17:44:21,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:21,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941348004] [2019-12-07 17:44:21,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:44:22,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941348004] [2019-12-07 17:44:22,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821200170] [2019-12-07 17:44:22,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:22,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:44:22,106 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:44:22,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:22,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2019-12-07 17:44:22,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379039656] [2019-12-07 17:44:22,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:44:22,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:22,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:44:22,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:44:22,112 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 8 states. [2019-12-07 17:44:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:22,195 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-12-07 17:44:22,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:44:22,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-07 17:44:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:22,196 INFO L225 Difference]: With dead ends: 67 [2019-12-07 17:44:22,196 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 17:44:22,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:44:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 17:44:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-12-07 17:44:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 17:44:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2019-12-07 17:44:22,198 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 57 [2019-12-07 17:44:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:22,199 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2019-12-07 17:44:22,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:44:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2019-12-07 17:44:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:44:22,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:22,199 INFO L410 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] [2019-12-07 17:44:22,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:22,400 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1992072423, now seen corresponding path program 1 times [2019-12-07 17:44:22,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:22,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912284151] [2019-12-07 17:44:22,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:23,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912284151] [2019-12-07 17:44:23,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259380165] [2019-12-07 17:44:23,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:23,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 87 conjunts are in the unsatisfiable core [2019-12-07 17:44:23,253 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:23,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:44:23,283 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:23,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:23,284 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:23,284 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:44:23,429 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:23,430 INFO L377 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 17:44:23,430 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:23,443 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 17:44:23,443 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:23,443 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-12-07 17:44:23,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:44:23,532 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:23,541 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:23,542 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:23,542 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2019-12-07 17:44:24,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-12-07 17:44:24,024 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:24,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:24,033 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:24,033 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2019-12-07 17:44:24,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-12-07 17:44:24,401 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:24,455 INFO L614 ElimStorePlain]: treesize reduction 18, result has 74.6 percent of original size [2019-12-07 17:44:24,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:24,465 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:44:24,468 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:24,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 40 [2019-12-07 17:44:24,469 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:24,507 INFO L614 ElimStorePlain]: treesize reduction 11, result has 77.1 percent of original size [2019-12-07 17:44:24,508 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:24,508 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:37 [2019-12-07 17:44:24,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:24,778 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:24,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 12 [2019-12-07 17:44:24,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:24,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:24,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:24,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-12-07 17:44:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:24,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:24,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 53 [2019-12-07 17:44:24,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88529719] [2019-12-07 17:44:24,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 17:44:24,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:24,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 17:44:24,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2696, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 17:44:24,843 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 54 states. [2019-12-07 17:44:26,834 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-07 17:44:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:28,141 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-12-07 17:44:28,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 17:44:28,141 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 58 [2019-12-07 17:44:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:28,142 INFO L225 Difference]: With dead ends: 79 [2019-12-07 17:44:28,142 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 17:44:28,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=519, Invalid=5333, Unknown=0, NotChecked=0, Total=5852 [2019-12-07 17:44:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 17:44:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2019-12-07 17:44:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 17:44:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-12-07 17:44:28,147 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 58 [2019-12-07 17:44:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:28,147 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-12-07 17:44:28,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 17:44:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-12-07 17:44:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:44:28,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:28,148 INFO L410 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] [2019-12-07 17:44:28,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:28,349 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:28,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1992072422, now seen corresponding path program 1 times [2019-12-07 17:44:28,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:28,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333248125] [2019-12-07 17:44:28,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:29,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333248125] [2019-12-07 17:44:29,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087378590] [2019-12-07 17:44:29,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:29,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 95 conjunts are in the unsatisfiable core [2019-12-07 17:44:29,085 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:29,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:44:29,114 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:29,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:29,120 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:44:29,120 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:29,124 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:29,124 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:29,124 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 17:44:29,506 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:29,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:44:29,507 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:29,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:29,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 17:44:29,518 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:29,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:29,527 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:29,527 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:29 [2019-12-07 17:44:29,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:44:29,651 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:29,663 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:29,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:44:29,666 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:29,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:29,678 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:29,678 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:55, output treesize:53 [2019-12-07 17:44:30,129 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_1|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|]} [2019-12-07 17:44:30,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 9 [2019-12-07 17:44:30,132 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:30,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:30,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:30,144 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:30,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2019-12-07 17:44:30,145 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:30,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:30,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:30,153 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:21 [2019-12-07 17:44:31,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:31,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:31,566 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:44:31,567 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:31,568 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 86 [2019-12-07 17:44:31,568 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:31,622 INFO L614 ElimStorePlain]: treesize reduction 19, result has 86.6 percent of original size [2019-12-07 17:44:31,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:31,652 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 17:44:31,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 96 [2019-12-07 17:44:31,653 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:31,692 INFO L614 ElimStorePlain]: treesize reduction 36, result has 71.0 percent of original size [2019-12-07 17:44:31,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:31,693 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:143, output treesize:88 [2019-12-07 17:44:32,087 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2019-12-07 17:44:32,093 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:32,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2019-12-07 17:44:32,094 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:32,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:32,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:44:32,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:44:32,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:32,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 18 [2019-12-07 17:44:32,123 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:32,136 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:32,137 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:32,137 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:85, output treesize:23 [2019-12-07 17:44:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:44:32,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:32,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 59 [2019-12-07 17:44:32,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268951201] [2019-12-07 17:44:32,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-12-07 17:44:32,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:32,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-12-07 17:44:32,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=3381, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 17:44:32,230 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 60 states. [2019-12-07 17:44:56,705 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-12-07 17:44:57,007 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-12-07 17:44:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:57,376 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-12-07 17:44:57,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 17:44:57,377 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 58 [2019-12-07 17:44:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:57,378 INFO L225 Difference]: With dead ends: 82 [2019-12-07 17:44:57,378 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 17:44:57,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=628, Invalid=8107, Unknown=7, NotChecked=0, Total=8742 [2019-12-07 17:44:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 17:44:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-12-07 17:44:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 17:44:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-12-07 17:44:57,383 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 58 [2019-12-07 17:44:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:57,383 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-12-07 17:44:57,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-12-07 17:44:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-12-07 17:44:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:44:57,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:57,384 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:57,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:57,585 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:44:57,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:57,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1537996614, now seen corresponding path program 1 times [2019-12-07 17:44:57,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:57,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207496301] [2019-12-07 17:44:57,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:58,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207496301] [2019-12-07 17:44:58,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599824034] [2019-12-07 17:44:58,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:58,350 INFO L264 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 59 conjunts are in the unsatisfiable core [2019-12-07 17:44:58,352 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:44:58,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:44:58,424 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:58,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:58,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:58,427 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-12-07 17:44:58,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:58,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:44:58,523 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:58,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:58,524 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:58,524 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-12-07 17:44:58,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-12-07 17:44:58,870 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:58,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:58,881 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:58,881 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 [2019-12-07 17:44:59,840 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_remove_first_~temp~1.base Int)) (let ((.cse0 (select |c_old(#memory_$Pointer$.base)| |c_sll_remove_first_#in~head.base|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_remove_first_#in~head.base| (store .cse0 |c_sll_remove_first_#in~head.offset| sll_remove_first_~temp~1.base))) (<= sll_remove_first_~temp~1.base (select (select |c_old(#memory_$Pointer$.base)| (select .cse0 |c_sll_remove_first_#in~head.offset|)) 4))))) is different from true [2019-12-07 17:44:59,845 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:59,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 26 [2019-12-07 17:44:59,845 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:59,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:59,851 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:44:59,851 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:24 [2019-12-07 17:44:59,985 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:59,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-12-07 17:44:59,986 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:44:59,987 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:44:59,987 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:44:59,987 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-12-07 17:44:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:44:59,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:44:59,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 44 [2019-12-07 17:44:59,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762645307] [2019-12-07 17:44:59,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-07 17:44:59,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:59,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-07 17:44:59,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1776, Unknown=1, NotChecked=84, Total=1980 [2019-12-07 17:44:59,997 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 45 states. [2019-12-07 17:45:01,018 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-07 17:45:01,293 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-12-07 17:45:03,080 WARN L192 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-12-07 17:45:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:03,985 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-12-07 17:45:03,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 17:45:03,985 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 62 [2019-12-07 17:45:03,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:03,986 INFO L225 Difference]: With dead ends: 81 [2019-12-07 17:45:03,986 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 17:45:03,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=455, Invalid=4659, Unknown=2, NotChecked=140, Total=5256 [2019-12-07 17:45:03,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 17:45:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-12-07 17:45:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 17:45:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-12-07 17:45:03,990 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 62 [2019-12-07 17:45:03,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:03,990 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-12-07 17:45:03,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-07 17:45:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-12-07 17:45:03,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 17:45:03,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:03,991 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:04,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:04,192 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:45:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:04,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1298831135, now seen corresponding path program 2 times [2019-12-07 17:45:04,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:04,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109063659] [2019-12-07 17:45:04,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:05,691 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-12-07 17:45:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:45:08,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109063659] [2019-12-07 17:45:08,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507974210] [2019-12-07 17:45:08,021 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:08,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:45:08,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:45:08,101 INFO L264 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 133 conjunts are in the unsatisfiable core [2019-12-07 17:45:08,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:08,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:08,226 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:08,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:08,228 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:08,228 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:45:08,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:08,763 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:08,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:08,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:08,772 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:08,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:08,778 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:08,779 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:30 [2019-12-07 17:45:09,509 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:09,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:45:09,510 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:09,527 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:09,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:09,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-12-07 17:45:09,532 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:09,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:09,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:09,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-12-07 17:45:09,550 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:09,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:09,562 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:09,563 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:81, output treesize:53 [2019-12-07 17:45:09,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-12-07 17:45:09,786 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:09,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:09,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-12-07 17:45:09,802 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:09,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:09,814 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:09,815 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:79, output treesize:53 [2019-12-07 17:45:11,981 WARN L192 SmtUtils]: Spent 810.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 17:45:11,984 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_BEFORE_CALL_7|], 20=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_35|]} [2019-12-07 17:45:11,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:11,989 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:11,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 54 [2019-12-07 17:45:11,990 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:12,007 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:12,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:12,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:12,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:12,012 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:45:12,012 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:45:12,021 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-12-07 17:45:12,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 66 [2019-12-07 17:45:12,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:12,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:12,022 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:12,050 INFO L614 ElimStorePlain]: treesize reduction 29, result has 70.1 percent of original size [2019-12-07 17:45:12,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:12,051 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:115, output treesize:55 [2019-12-07 17:45:12,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-12-07 17:45:12,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:12,700 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:12,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:12,701 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:63 [2019-12-07 17:45:12,848 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:12,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 17:45:12,849 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:12,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:12,859 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:12,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:66 [2019-12-07 17:45:13,271 INFO L430 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_BEFORE_CALL_9|], 20=[|v_#memory_$Pointer$.base_BEFORE_CALL_15|]} [2019-12-07 17:45:13,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:13,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 74 [2019-12-07 17:45:13,277 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:13,308 INFO L614 ElimStorePlain]: treesize reduction 18, result has 84.3 percent of original size [2019-12-07 17:45:13,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:13,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:13,312 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:45:13,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:13,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 95 [2019-12-07 17:45:13,321 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:13,347 INFO L614 ElimStorePlain]: treesize reduction 43, result has 65.6 percent of original size [2019-12-07 17:45:13,347 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:13,347 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:120, output treesize:82 [2019-12-07 17:45:13,489 INFO L430 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 11=[|#memory_$Pointer$.base|]} [2019-12-07 17:45:13,492 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:45:13,492 INFO L377 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 36 treesize of output 10 [2019-12-07 17:45:13,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:13,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:13,506 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:45:13,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:13,514 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-12-07 17:45:13,514 INFO L377 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 6 case distinctions, treesize of input 52 treesize of output 32 [2019-12-07 17:45:13,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:45:13,515 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:13,521 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:13,521 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:13,521 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:99, output treesize:7 [2019-12-07 17:45:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:45:13,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:45:13,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 76 [2019-12-07 17:45:13,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251609931] [2019-12-07 17:45:13,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-12-07 17:45:13,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:13,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-12-07 17:45:13,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=5442, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 17:45:13,551 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 76 states. [2019-12-07 17:45:15,401 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 71 [2019-12-07 17:45:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:19,170 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-12-07 17:45:19,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 17:45:19,170 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 71 [2019-12-07 17:45:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:19,171 INFO L225 Difference]: With dead ends: 77 [2019-12-07 17:45:19,171 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 17:45:19,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1506 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=496, Invalid=9404, Unknown=0, NotChecked=0, Total=9900 [2019-12-07 17:45:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 17:45:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-12-07 17:45:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 17:45:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-12-07 17:45:19,176 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 71 [2019-12-07 17:45:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:19,176 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-12-07 17:45:19,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-12-07 17:45:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-12-07 17:45:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 17:45:19,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:19,176 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:19,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:19,377 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:45:19,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:19,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1298831070, now seen corresponding path program 1 times [2019-12-07 17:45:19,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:19,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928434135] [2019-12-07 17:45:19,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:45:20,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928434135] [2019-12-07 17:45:20,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642034708] [2019-12-07 17:45:20,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:20,839 INFO L264 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 106 conjunts are in the unsatisfiable core [2019-12-07 17:45:20,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:45:21,084 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:45:21,084 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:21,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:21,091 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:45:21,091 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-12-07 17:45:21,372 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:45:21,372 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:21,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:21,381 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:21,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:52 [2019-12-07 17:45:21,820 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:21,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 70 treesize of output 102 [2019-12-07 17:45:21,820 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:21,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:21,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:21,834 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:21,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 21 [2019-12-07 17:45:21,834 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:21,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:21,848 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:21,848 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:12 [2019-12-07 17:45:22,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 17:45:22,260 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:22,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:22,273 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:22,273 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:52 [2019-12-07 17:45:23,862 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:23,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2019-12-07 17:45:23,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:45:23,882 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:23,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:23,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:23,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:45:23,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:23,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 63 [2019-12-07 17:45:23,888 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:23,919 INFO L614 ElimStorePlain]: treesize reduction 15, result has 84.7 percent of original size [2019-12-07 17:45:23,919 INFO L534 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-12-07 17:45:23,919 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:133, output treesize:77 [2019-12-07 17:45:24,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:45:24,447 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:45:24,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 52 [2019-12-07 17:45:24,448 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:24,467 INFO L614 ElimStorePlain]: treesize reduction 19, result has 70.8 percent of original size [2019-12-07 17:45:24,467 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:45:24,467 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:110, output treesize:40 [2019-12-07 17:45:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:45:24,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:45:24,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 37] total 67 [2019-12-07 17:45:24,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369076320] [2019-12-07 17:45:24,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-12-07 17:45:24,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:24,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-12-07 17:45:24,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=4335, Unknown=1, NotChecked=0, Total=4556 [2019-12-07 17:45:24,703 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 68 states. [2019-12-07 17:45:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:31,011 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2019-12-07 17:45:31,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 17:45:31,011 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 71 [2019-12-07 17:45:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:31,012 INFO L225 Difference]: With dead ends: 89 [2019-12-07 17:45:31,012 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 17:45:31,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2046 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=540, Invalid=8770, Unknown=2, NotChecked=0, Total=9312 [2019-12-07 17:45:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 17:45:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-12-07 17:45:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 17:45:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-12-07 17:45:31,016 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 71 [2019-12-07 17:45:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:31,016 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-12-07 17:45:31,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-12-07 17:45:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-12-07 17:45:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 17:45:31,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:45:31,017 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:45:31,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:45:31,218 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr10REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-12-07 17:45:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:45:31,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1605892726, now seen corresponding path program 2 times [2019-12-07 17:45:31,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:45:31,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468883967] [2019-12-07 17:45:31,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:45:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:45:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 17:45:31,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468883967] [2019-12-07 17:45:31,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:45:31,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:45:31,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784176406] [2019-12-07 17:45:31,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:45:31,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:45:31,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:45:31,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:45:31,295 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 9 states. [2019-12-07 17:45:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:45:31,378 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-12-07 17:45:31,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:45:31,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-12-07 17:45:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:45:31,379 INFO L225 Difference]: With dead ends: 61 [2019-12-07 17:45:31,379 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:45:31,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:45:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:45:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:45:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:45:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:45:31,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2019-12-07 17:45:31,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:45:31,380 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:45:31,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:45:31,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:45:31,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:45:31,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:45:31 BoogieIcfgContainer [2019-12-07 17:45:31,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:45:31,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:45:31,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:45:31,384 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:45:31,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:44:11" (3/4) ... [2019-12-07 17:45:31,386 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:45:31,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 17:45:31,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-12-07 17:45:31,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 17:45:31,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 17:45:31,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2019-12-07 17:45:31,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 17:45:31,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_remove_first [2019-12-07 17:45:31,392 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-12-07 17:45:31,395 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-12-07 17:45:31,395 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 17:45:31,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 17:45:31,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 17:45:31,426 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e2f457f9-80d4-4747-a4b8-487ea84698e0/bin/uautomizer/witness.graphml [2019-12-07 17:45:31,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:45:31,427 INFO L168 Benchmark]: Toolchain (without parser) took 80330.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:31,427 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:45:31,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:31,428 INFO L168 Benchmark]: Boogie Preprocessor took 37.66 ms. Allocated memory is still 1.1 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-12-07 17:45:31,428 INFO L168 Benchmark]: RCFGBuilder took 318.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:31,428 INFO L168 Benchmark]: TraceAbstraction took 79613.48 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 146.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:31,429 INFO L168 Benchmark]: Witness Printer took 42.56 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:45:31,430 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.66 ms. Allocated memory is still 1.1 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 318.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79613.48 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 146.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Witness Printer took 42.56 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 586]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 77 locations, 21 error locations. Result: SAFE, OverallTime: 79.5s, OverallIterations: 25, TraceHistogramMax: 3, AutomataDifference: 49.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 965 SDtfs, 2188 SDslu, 6134 SDs, 0 SdLazy, 14725 SolverSat, 567 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1322 GetRequests, 595 SyntacticMatches, 17 SemanticMatches, 710 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7238 ImplicationChecksByTransitivity, 51.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 156 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 1670 NumberOfCodeBlocks, 1670 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1634 ConstructedInterpolants, 162 QuantifiedInterpolants, 1289991 SizeOfPredicates, 154 NumberOfNonLiveVariables, 3148 ConjunctsInSsa, 551 ConjunctsInUnsatCore, 36 InterpolantComputations, 15 PerfectInterpolantSequences, 314/590 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...