./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash abd6dbc145d5f477746656086724ee83e0738836 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:40:30,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:40:30,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:40:30,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:40:30,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:40:30,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:40:30,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:40:30,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:40:30,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:40:30,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:40:30,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:40:30,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:40:30,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:40:30,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:40:30,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:40:30,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:40:30,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:40:30,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:40:30,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:40:30,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:40:30,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:40:30,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:40:30,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:40:30,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:40:30,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:40:30,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:40:30,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:40:30,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:40:30,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:40:30,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:40:30,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:40:30,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:40:30,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:40:30,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:40:30,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:40:30,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:40:30,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:40:30,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:40:30,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:40:30,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:40:30,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:40:30,597 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:40:30,617 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:40:30,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:40:30,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:40:30,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:40:30,619 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:40:30,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:40:30,620 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:40:30,621 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:40:30,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:40:30,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:40:30,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:40:30,623 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:40:30,623 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:40:30,623 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:40:30,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:40:30,624 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:40:30,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:40:30,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:40:30,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:40:30,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:40:30,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:40:30,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:40:30,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:40:30,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:40:30,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:40:30,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:40:30,626 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_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> abd6dbc145d5f477746656086724ee83e0738836 [2019-11-16 00:40:30,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:40:30,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:40:30,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:40:30,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:40:30,685 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:40:30,685 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-11-16 00:40:30,736 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/data/5090b9034/a9e0423bd2af43f698eb134ba4eb1636/FLAG6968812fd [2019-11-16 00:40:31,201 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:40:31,205 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-11-16 00:40:31,221 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/data/5090b9034/a9e0423bd2af43f698eb134ba4eb1636/FLAG6968812fd [2019-11-16 00:40:31,704 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/data/5090b9034/a9e0423bd2af43f698eb134ba4eb1636 [2019-11-16 00:40:31,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:40:31,708 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:40:31,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:31,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:40:31,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:40:31,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:31" (1/1) ... [2019-11-16 00:40:31,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29182534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:31, skipping insertion in model container [2019-11-16 00:40:31,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:31" (1/1) ... [2019-11-16 00:40:31,723 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:40:31,773 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:40:32,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:32,128 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:40:32,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:32,215 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:40:32,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:32 WrapperNode [2019-11-16 00:40:32,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:32,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:40:32,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:40:32,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:40:32,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:32" (1/1) ... [2019-11-16 00:40:32,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:32" (1/1) ... [2019-11-16 00:40:32,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:32" (1/1) ... [2019-11-16 00:40:32,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:32" (1/1) ... [2019-11-16 00:40:32,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:32" (1/1) ... [2019-11-16 00:40:32,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:32" (1/1) ... [2019-11-16 00:40:32,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:32" (1/1) ... [2019-11-16 00:40:32,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:40:32,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:40:32,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:40:32,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:40:32,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:40:32,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:40:32,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:40:32,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:40:32,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:40:32,340 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:40:32,341 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:40:32,342 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-16 00:40:32,342 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-16 00:40:32,342 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2019-11-16 00:40:32,342 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2019-11-16 00:40:32,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:40:32,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:40:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:40:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:40:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:40:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:40:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:40:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:40:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:40:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:40:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:40:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:40:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:40:32,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:40:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:40:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:40:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:40:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:40:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:40:32,348 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:40:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:40:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:40:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:40:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:40:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:40:32,349 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:40:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:40:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:40:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:40:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:40:32,350 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:40:32,351 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:40:32,351 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:40:32,351 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:40:32,351 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:40:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:40:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:40:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:40:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:40:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:40:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:40:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:40:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:40:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:40:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:40:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:40:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:40:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:40:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:40:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:40:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:40:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:40:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:40:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:40:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:40:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:40:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:40:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:40:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:40:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:40:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:40:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:40:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:40:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:40:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:40:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:40:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:40:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:40:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:40:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:40:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:40:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:40:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:40:32,360 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:40:32,360 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:40:32,360 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:40:32,360 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:40:32,361 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:40:32,361 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:40:32,361 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:40:32,361 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:40:32,361 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:40:32,361 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:40:32,362 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:40:32,362 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:40:32,362 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:40:32,362 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:40:32,362 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:40:32,362 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:40:32,362 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:40:32,363 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:40:32,363 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:40:32,363 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:40:32,363 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:40:32,363 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:40:32,363 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:40:32,363 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:40:32,363 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:40:32,364 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:40:32,364 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:40:32,364 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:40:32,364 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:40:32,364 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:40:32,364 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:40:32,364 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:40:32,364 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:40:32,365 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:40:32,365 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:40:32,365 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:40:32,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:40:32,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:40:32,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:40:32,366 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-16 00:40:32,366 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-16 00:40:32,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:40:32,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:40:32,366 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2019-11-16 00:40:32,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:40:32,367 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2019-11-16 00:40:32,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:40:32,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:40:32,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:40:32,665 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:40:32,982 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:40:32,982 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-16 00:40:32,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:32 BoogieIcfgContainer [2019-11-16 00:40:32,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:40:32,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:40:32,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:40:32,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:40:32,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:40:31" (1/3) ... [2019-11-16 00:40:32,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d2c3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:32, skipping insertion in model container [2019-11-16 00:40:32,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:32" (2/3) ... [2019-11-16 00:40:32,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d2c3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:32, skipping insertion in model container [2019-11-16 00:40:32,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:32" (3/3) ... [2019-11-16 00:40:32,990 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2019-11-16 00:40:33,007 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:40:33,018 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2019-11-16 00:40:33,027 INFO L249 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2019-11-16 00:40:33,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:40:33,042 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:40:33,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:40:33,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:40:33,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:40:33,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:40:33,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:40:33,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:40:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-11-16 00:40:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:40:33,079 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:33,080 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:33,085 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:33,091 INFO L82 PathProgramCache]: Analyzing trace with hash -154446967, now seen corresponding path program 1 times [2019-11-16 00:40:33,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:33,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918558710] [2019-11-16 00:40:33,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:33,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:33,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:33,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918558710] [2019-11-16 00:40:33,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:33,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:33,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252464479] [2019-11-16 00:40:33,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:33,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:33,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:33,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:33,323 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2019-11-16 00:40:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:33,650 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2019-11-16 00:40:33,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:33,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:40:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:33,663 INFO L225 Difference]: With dead ends: 120 [2019-11-16 00:40:33,663 INFO L226 Difference]: Without dead ends: 113 [2019-11-16 00:40:33,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:33,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-16 00:40:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2019-11-16 00:40:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-16 00:40:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-11-16 00:40:33,727 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 12 [2019-11-16 00:40:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:33,728 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-11-16 00:40:33,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-11-16 00:40:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:40:33,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:33,729 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:33,729 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:33,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:33,730 INFO L82 PathProgramCache]: Analyzing trace with hash -154446966, now seen corresponding path program 1 times [2019-11-16 00:40:33,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:33,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804775293] [2019-11-16 00:40:33,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:33,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:33,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:33,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804775293] [2019-11-16 00:40:33,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:33,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:33,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528967645] [2019-11-16 00:40:33,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:33,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:33,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:33,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:33,813 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 4 states. [2019-11-16 00:40:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:34,063 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2019-11-16 00:40:34,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:34,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:40:34,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:34,065 INFO L225 Difference]: With dead ends: 111 [2019-11-16 00:40:34,065 INFO L226 Difference]: Without dead ends: 111 [2019-11-16 00:40:34,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-16 00:40:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2019-11-16 00:40:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-16 00:40:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-11-16 00:40:34,076 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 12 [2019-11-16 00:40:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:34,077 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-11-16 00:40:34,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-11-16 00:40:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:40:34,078 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:34,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:34,079 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:34,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:34,079 INFO L82 PathProgramCache]: Analyzing trace with hash -308881252, now seen corresponding path program 1 times [2019-11-16 00:40:34,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:34,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819250658] [2019-11-16 00:40:34,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:34,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:34,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:34,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819250658] [2019-11-16 00:40:34,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:34,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:40:34,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247498444] [2019-11-16 00:40:34,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:40:34,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:34,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:40:34,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:34,294 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 8 states. [2019-11-16 00:40:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:34,892 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-11-16 00:40:34,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:40:34,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-16 00:40:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:34,894 INFO L225 Difference]: With dead ends: 115 [2019-11-16 00:40:34,894 INFO L226 Difference]: Without dead ends: 115 [2019-11-16 00:40:34,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:40:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-16 00:40:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 94. [2019-11-16 00:40:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-16 00:40:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2019-11-16 00:40:34,916 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 19 [2019-11-16 00:40:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:34,917 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2019-11-16 00:40:34,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:40:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2019-11-16 00:40:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:40:34,918 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:34,918 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:34,919 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:34,919 INFO L82 PathProgramCache]: Analyzing trace with hash -308881251, now seen corresponding path program 1 times [2019-11-16 00:40:34,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:34,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002326088] [2019-11-16 00:40:34,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:34,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:34,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:35,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002326088] [2019-11-16 00:40:35,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:35,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:40:35,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547010297] [2019-11-16 00:40:35,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:40:35,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:35,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:40:35,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:40:35,026 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 7 states. [2019-11-16 00:40:35,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:35,458 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-16 00:40:35,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:40:35,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-16 00:40:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:35,460 INFO L225 Difference]: With dead ends: 112 [2019-11-16 00:40:35,460 INFO L226 Difference]: Without dead ends: 112 [2019-11-16 00:40:35,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:40:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-16 00:40:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2019-11-16 00:40:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-16 00:40:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2019-11-16 00:40:35,469 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 19 [2019-11-16 00:40:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:35,469 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2019-11-16 00:40:35,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:40:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2019-11-16 00:40:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:40:35,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:35,471 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:35,471 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:35,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1499366792, now seen corresponding path program 1 times [2019-11-16 00:40:35,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:35,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602678844] [2019-11-16 00:40:35,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:35,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:35,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:40:35,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602678844] [2019-11-16 00:40:35,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:35,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:40:35,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150614317] [2019-11-16 00:40:35,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:40:35,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:35,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:40:35,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:35,684 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 8 states. [2019-11-16 00:40:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:36,103 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-11-16 00:40:36,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:40:36,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-16 00:40:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:36,105 INFO L225 Difference]: With dead ends: 112 [2019-11-16 00:40:36,105 INFO L226 Difference]: Without dead ends: 112 [2019-11-16 00:40:36,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:40:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-16 00:40:36,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2019-11-16 00:40:36,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-16 00:40:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-11-16 00:40:36,112 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 28 [2019-11-16 00:40:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:36,113 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-11-16 00:40:36,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:40:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-11-16 00:40:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:40:36,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:36,114 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:36,114 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:36,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:36,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1499366791, now seen corresponding path program 1 times [2019-11-16 00:40:36,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:36,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000712328] [2019-11-16 00:40:36,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:36,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:36,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:40:36,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000712328] [2019-11-16 00:40:36,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:36,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:40:36,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293571517] [2019-11-16 00:40:36,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:40:36,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:36,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:40:36,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:36,240 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 8 states. [2019-11-16 00:40:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:36,609 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2019-11-16 00:40:36,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:40:36,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-16 00:40:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:36,611 INFO L225 Difference]: With dead ends: 111 [2019-11-16 00:40:36,611 INFO L226 Difference]: Without dead ends: 111 [2019-11-16 00:40:36,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:40:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-16 00:40:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2019-11-16 00:40:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-16 00:40:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-11-16 00:40:36,619 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 28 [2019-11-16 00:40:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:36,620 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-11-16 00:40:36,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:40:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-11-16 00:40:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:40:36,621 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:36,621 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:36,622 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:36,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:36,622 INFO L82 PathProgramCache]: Analyzing trace with hash 23894858, now seen corresponding path program 1 times [2019-11-16 00:40:36,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:36,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129253644] [2019-11-16 00:40:36,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:36,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:36,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:40:36,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129253644] [2019-11-16 00:40:36,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141739131] [2019-11-16 00:40:36,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:36,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:40:36,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:37,074 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:40:37,101 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:37,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2019-11-16 00:40:37,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:37,128 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:40:37,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:40:37,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-16 00:40:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:40:37,138 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:40:37,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-16 00:40:37,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191492691] [2019-11-16 00:40:37,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:40:37,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:37,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:40:37,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:40:37,140 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2019-11-16 00:40:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:38,007 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2019-11-16 00:40:38,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:40:38,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-16 00:40:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:38,009 INFO L225 Difference]: With dead ends: 125 [2019-11-16 00:40:38,009 INFO L226 Difference]: Without dead ends: 125 [2019-11-16 00:40:38,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:40:38,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-16 00:40:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 90. [2019-11-16 00:40:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-16 00:40:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2019-11-16 00:40:38,016 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 31 [2019-11-16 00:40:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:38,016 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2019-11-16 00:40:38,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:40:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2019-11-16 00:40:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:40:38,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:38,018 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:38,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:38,219 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:38,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:38,219 INFO L82 PathProgramCache]: Analyzing trace with hash 23894859, now seen corresponding path program 1 times [2019-11-16 00:40:38,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:38,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292627303] [2019-11-16 00:40:38,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:38,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:38,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:40:38,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292627303] [2019-11-16 00:40:38,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106311106] [2019-11-16 00:40:38,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:38,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-16 00:40:38,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:38,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:40:38,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:38,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:38,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:38,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:40:38,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:38,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 33 [2019-11-16 00:40:38,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:38,784 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-16 00:40:38,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:40:38,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-11-16 00:40:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:40:38,816 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:40:38,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-16 00:40:38,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894838771] [2019-11-16 00:40:38,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:40:38,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:38,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:40:38,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:40:38,818 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 16 states. [2019-11-16 00:40:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:39,698 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2019-11-16 00:40:39,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:40:39,699 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-16 00:40:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:39,700 INFO L225 Difference]: With dead ends: 110 [2019-11-16 00:40:39,700 INFO L226 Difference]: Without dead ends: 110 [2019-11-16 00:40:39,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:40:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-16 00:40:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2019-11-16 00:40:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-16 00:40:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2019-11-16 00:40:39,705 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 31 [2019-11-16 00:40:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:39,706 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2019-11-16 00:40:39,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:40:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2019-11-16 00:40:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-16 00:40:39,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:39,707 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:39,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:39,911 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1977617260, now seen corresponding path program 1 times [2019-11-16 00:40:39,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:39,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895090275] [2019-11-16 00:40:39,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:39,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:39,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:40:40,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895090275] [2019-11-16 00:40:40,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:40,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:40:40,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853391352] [2019-11-16 00:40:40,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:40:40,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:40,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:40:40,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:40:40,175 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 14 states. [2019-11-16 00:40:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:41,096 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2019-11-16 00:40:41,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:40:41,097 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-11-16 00:40:41,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:41,098 INFO L225 Difference]: With dead ends: 117 [2019-11-16 00:40:41,098 INFO L226 Difference]: Without dead ends: 117 [2019-11-16 00:40:41,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:40:41,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-16 00:40:41,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 92. [2019-11-16 00:40:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-16 00:40:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-11-16 00:40:41,103 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 40 [2019-11-16 00:40:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:41,104 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-11-16 00:40:41,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:40:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-11-16 00:40:41,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-16 00:40:41,105 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:41,105 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:41,106 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:41,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1977617261, now seen corresponding path program 1 times [2019-11-16 00:40:41,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:41,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717316205] [2019-11-16 00:40:41,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:41,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:41,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:40:41,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717316205] [2019-11-16 00:40:41,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:41,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:40:41,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611062300] [2019-11-16 00:40:41,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:40:41,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:41,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:40:41,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:40:41,449 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 14 states. [2019-11-16 00:40:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:42,523 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-11-16 00:40:42,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:40:42,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-11-16 00:40:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:42,525 INFO L225 Difference]: With dead ends: 115 [2019-11-16 00:40:42,525 INFO L226 Difference]: Without dead ends: 115 [2019-11-16 00:40:42,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:40:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-16 00:40:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2019-11-16 00:40:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-16 00:40:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2019-11-16 00:40:42,530 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 40 [2019-11-16 00:40:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:42,530 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2019-11-16 00:40:42,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:40:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2019-11-16 00:40:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:40:42,532 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:42,532 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:42,533 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash 496965592, now seen corresponding path program 1 times [2019-11-16 00:40:42,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:42,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466164271] [2019-11-16 00:40:42,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:42,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:42,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:40:42,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466164271] [2019-11-16 00:40:42,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:42,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:40:42,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357049619] [2019-11-16 00:40:42,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:40:42,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:42,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:40:42,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:40:42,753 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 14 states. [2019-11-16 00:40:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:43,572 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2019-11-16 00:40:43,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:40:43,572 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-11-16 00:40:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:43,574 INFO L225 Difference]: With dead ends: 113 [2019-11-16 00:40:43,574 INFO L226 Difference]: Without dead ends: 113 [2019-11-16 00:40:43,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:40:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-16 00:40:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2019-11-16 00:40:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-16 00:40:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2019-11-16 00:40:43,578 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 42 [2019-11-16 00:40:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:43,579 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2019-11-16 00:40:43,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:40:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2019-11-16 00:40:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:40:43,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:43,585 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:43,586 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash 496965593, now seen corresponding path program 1 times [2019-11-16 00:40:43,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:43,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315608044] [2019-11-16 00:40:43,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:43,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:43,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:40:43,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315608044] [2019-11-16 00:40:43,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:43,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:40:43,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792628069] [2019-11-16 00:40:43,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:43,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:43,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:43,690 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand 6 states. [2019-11-16 00:40:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:43,996 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2019-11-16 00:40:43,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:40:43,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-16 00:40:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:43,997 INFO L225 Difference]: With dead ends: 117 [2019-11-16 00:40:43,998 INFO L226 Difference]: Without dead ends: 117 [2019-11-16 00:40:43,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-16 00:40:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2019-11-16 00:40:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-16 00:40:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-11-16 00:40:44,002 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 42 [2019-11-16 00:40:44,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:44,002 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-11-16 00:40:44,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-11-16 00:40:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:40:44,003 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:44,003 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:44,004 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:44,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1131082394, now seen corresponding path program 1 times [2019-11-16 00:40:44,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:44,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616325041] [2019-11-16 00:40:44,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:44,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:44,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:40:44,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616325041] [2019-11-16 00:40:44,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:44,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:40:44,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119575746] [2019-11-16 00:40:44,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:40:44,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:44,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:40:44,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:40:44,099 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2019-11-16 00:40:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:44,427 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-11-16 00:40:44,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:40:44,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-16 00:40:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:44,429 INFO L225 Difference]: With dead ends: 122 [2019-11-16 00:40:44,429 INFO L226 Difference]: Without dead ends: 122 [2019-11-16 00:40:44,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:40:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-16 00:40:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2019-11-16 00:40:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-16 00:40:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2019-11-16 00:40:44,434 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 43 [2019-11-16 00:40:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:44,434 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2019-11-16 00:40:44,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:40:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2019-11-16 00:40:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:40:44,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:44,435 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:44,435 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:44,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:44,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2084519806, now seen corresponding path program 1 times [2019-11-16 00:40:44,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:44,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666367319] [2019-11-16 00:40:44,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:44,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:44,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:40:44,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666367319] [2019-11-16 00:40:44,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:44,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-16 00:40:44,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025239726] [2019-11-16 00:40:44,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:40:44,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:44,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:40:44,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:40:44,710 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 15 states. [2019-11-16 00:40:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:45,508 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-11-16 00:40:45,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:40:45,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-11-16 00:40:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:45,510 INFO L225 Difference]: With dead ends: 127 [2019-11-16 00:40:45,510 INFO L226 Difference]: Without dead ends: 127 [2019-11-16 00:40:45,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:40:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-16 00:40:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2019-11-16 00:40:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-16 00:40:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-11-16 00:40:45,515 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 50 [2019-11-16 00:40:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:45,515 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-11-16 00:40:45,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:40:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-11-16 00:40:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:40:45,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:45,516 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:45,516 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:45,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:45,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2084519805, now seen corresponding path program 1 times [2019-11-16 00:40:45,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:45,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154809380] [2019-11-16 00:40:45,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:45,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:45,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:40:45,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154809380] [2019-11-16 00:40:45,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:45,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-16 00:40:45,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728142703] [2019-11-16 00:40:45,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:40:45,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:45,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:40:45,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:40:45,773 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 15 states. [2019-11-16 00:40:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:46,441 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2019-11-16 00:40:46,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:40:46,442 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-11-16 00:40:46,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:46,443 INFO L225 Difference]: With dead ends: 124 [2019-11-16 00:40:46,443 INFO L226 Difference]: Without dead ends: 124 [2019-11-16 00:40:46,443 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:40:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-16 00:40:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2019-11-16 00:40:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-16 00:40:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2019-11-16 00:40:46,448 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 50 [2019-11-16 00:40:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:46,448 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2019-11-16 00:40:46,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:40:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2019-11-16 00:40:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:40:46,449 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:46,449 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:46,449 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:40:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:46,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1251853306, now seen corresponding path program 1 times [2019-11-16 00:40:46,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:46,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767786335] [2019-11-16 00:40:46,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:46,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:46,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:40:47,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767786335] [2019-11-16 00:40:47,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768613230] [2019-11-16 00:40:47,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:47,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 82 conjunts are in the unsatisfiable core [2019-11-16 00:40:47,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:47,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:40:47,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:47,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:47,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:47,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-16 00:40:47,882 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:40:47,890 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:47,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 39 [2019-11-16 00:40:47,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:40:47,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:40:47,928 INFO L567 ElimStorePlain]: treesize reduction 21, result has 65.0 percent of original size [2019-11-16 00:40:47,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:40:47,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2019-11-16 00:40:48,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:40:48,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:48,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2019-11-16 00:40:48,203 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:40:48,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:48,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:40:48,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:14 [2019-11-16 00:41:06,515 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-11-16 00:41:06,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:06,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:06,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:41:06,553 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:06,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2019-11-16 00:41:06,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:06,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:06,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:41:06,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:43 [2019-11-16 00:41:06,787 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:41:06,792 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:06,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-11-16 00:41:06,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:06,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:06,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:41:06,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:11 [2019-11-16 00:41:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:41:06,839 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:41:06,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 45 [2019-11-16 00:41:06,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956252087] [2019-11-16 00:41:06,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-16 00:41:06,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-16 00:41:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1927, Unknown=23, NotChecked=0, Total=2070 [2019-11-16 00:41:06,842 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 46 states. [2019-11-16 00:41:10,232 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-16 00:41:12,990 WARN L191 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-11-16 00:41:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:13,822 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2019-11-16 00:41:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-16 00:41:13,822 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 51 [2019-11-16 00:41:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:13,824 INFO L225 Difference]: With dead ends: 186 [2019-11-16 00:41:13,824 INFO L226 Difference]: Without dead ends: 186 [2019-11-16 00:41:13,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=379, Invalid=4428, Unknown=23, NotChecked=0, Total=4830 [2019-11-16 00:41:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-16 00:41:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 138. [2019-11-16 00:41:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-16 00:41:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2019-11-16 00:41:13,832 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 51 [2019-11-16 00:41:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:13,832 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2019-11-16 00:41:13,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-16 00:41:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2019-11-16 00:41:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:41:13,833 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:13,833 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:14,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:14,047 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:41:14,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1251853305, now seen corresponding path program 1 times [2019-11-16 00:41:14,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:41:14,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167905870] [2019-11-16 00:41:14,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:14,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:41:14,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:41:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:41:15,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167905870] [2019-11-16 00:41:15,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690788748] [2019-11-16 00:41:15,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:41:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:15,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 88 conjunts are in the unsatisfiable core [2019-11-16 00:41:15,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:15,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:15,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-16 00:41:15,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,650 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:41:15,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,659 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-11-16 00:41:15,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:41:15,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:41:15,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,794 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2019-11-16 00:41:15,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2019-11-16 00:41:15,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 64 [2019-11-16 00:41:15,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:41:15,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:41:15,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-16 00:41:15,986 INFO L567 ElimStorePlain]: treesize reduction 51, result has 54.5 percent of original size [2019-11-16 00:41:15,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:41:15,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:60 [2019-11-16 00:41:16,334 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:16,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2019-11-16 00:41:16,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:41:16,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:41:16,337 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:41:16,366 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.2 percent of original size [2019-11-16 00:41:16,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-16 00:41:16,370 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:16,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:16,388 INFO L496 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-11-16 00:41:16,388 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:21 [2019-11-16 00:41:37,232 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-16 00:41:37,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:37,357 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-16 00:41:37,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 65 [2019-11-16 00:41:37,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:37,408 INFO L567 ElimStorePlain]: treesize reduction 34, result has 73.8 percent of original size [2019-11-16 00:41:37,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:37,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2019-11-16 00:41:37,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:37,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:37,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:41:37,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:115, output treesize:74 [2019-11-16 00:41:37,682 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:37,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 44 [2019-11-16 00:41:37,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:37,704 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.6 percent of original size [2019-11-16 00:41:37,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-16 00:41:37,707 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:37,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:37,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:41:37,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:22 [2019-11-16 00:41:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:41:37,870 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:41:37,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 49 [2019-11-16 00:41:37,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521442357] [2019-11-16 00:41:37,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-11-16 00:41:37,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:41:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-11-16 00:41:37,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2321, Unknown=13, NotChecked=0, Total=2450 [2019-11-16 00:41:37,872 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand 50 states. [2019-11-16 00:41:51,579 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-11-16 00:41:57,719 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-11-16 00:41:58,606 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-11-16 00:42:02,843 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 105 DAG size of output: 80 [2019-11-16 00:42:03,227 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-11-16 00:42:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:41,061 INFO L93 Difference]: Finished difference Result 275 states and 305 transitions. [2019-11-16 00:42:41,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-16 00:42:41,062 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 51 [2019-11-16 00:42:41,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:41,063 INFO L225 Difference]: With dead ends: 275 [2019-11-16 00:42:41,064 INFO L226 Difference]: Without dead ends: 275 [2019-11-16 00:42:41,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=471, Invalid=6135, Unknown=36, NotChecked=0, Total=6642 [2019-11-16 00:42:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-16 00:42:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 159. [2019-11-16 00:42:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-16 00:42:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 187 transitions. [2019-11-16 00:42:41,074 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 187 transitions. Word has length 51 [2019-11-16 00:42:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:41,074 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 187 transitions. [2019-11-16 00:42:41,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-11-16 00:42:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 187 transitions. [2019-11-16 00:42:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:42:41,075 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:41,076 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:41,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:41,279 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:42:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1000844765, now seen corresponding path program 1 times [2019-11-16 00:42:41,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:41,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217210847] [2019-11-16 00:42:41,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:42:41,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217210847] [2019-11-16 00:42:41,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:41,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:42:41,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480628543] [2019-11-16 00:42:41,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:42:41,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:42:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:41,366 INFO L87 Difference]: Start difference. First operand 159 states and 187 transitions. Second operand 8 states. [2019-11-16 00:42:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:41,677 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2019-11-16 00:42:41,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:42:41,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-16 00:42:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:41,678 INFO L225 Difference]: With dead ends: 185 [2019-11-16 00:42:41,679 INFO L226 Difference]: Without dead ends: 185 [2019-11-16 00:42:41,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:42:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-16 00:42:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 166. [2019-11-16 00:42:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-16 00:42:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 194 transitions. [2019-11-16 00:42:41,685 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 194 transitions. Word has length 53 [2019-11-16 00:42:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:41,685 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 194 transitions. [2019-11-16 00:42:41,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:42:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 194 transitions. [2019-11-16 00:42:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:42:41,686 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:41,686 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:41,686 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:42:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash -759118912, now seen corresponding path program 2 times [2019-11-16 00:42:41,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:41,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228735350] [2019-11-16 00:42:41,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:42:41,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228735350] [2019-11-16 00:42:41,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672315500] [2019-11-16 00:42:41,823 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:41,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:42:41,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:42:41,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:42:41,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:42:42,000 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:42:42,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-11-16 00:42:42,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767651650] [2019-11-16 00:42:42,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:42:42,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:42,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:42:42,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:42:42,002 INFO L87 Difference]: Start difference. First operand 166 states and 194 transitions. Second operand 10 states. [2019-11-16 00:42:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:42,340 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2019-11-16 00:42:42,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:42:42,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-16 00:42:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:42,341 INFO L225 Difference]: With dead ends: 169 [2019-11-16 00:42:42,341 INFO L226 Difference]: Without dead ends: 169 [2019-11-16 00:42:42,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:42:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-16 00:42:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 153. [2019-11-16 00:42:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-16 00:42:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2019-11-16 00:42:42,347 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 54 [2019-11-16 00:42:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:42,347 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2019-11-16 00:42:42,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:42:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2019-11-16 00:42:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:42:42,348 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:42,349 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:42,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:42,552 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:42:42,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1266677384, now seen corresponding path program 1 times [2019-11-16 00:42:42,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:42,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260055315] [2019-11-16 00:42:42,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:42,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:42,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:42:42,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260055315] [2019-11-16 00:42:42,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:42,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-16 00:42:42,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721595282] [2019-11-16 00:42:42,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:42:42,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:42,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:42:42,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:42:42,857 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 15 states. [2019-11-16 00:42:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:43,498 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2019-11-16 00:42:43,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:42:43,498 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2019-11-16 00:42:43,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:43,499 INFO L225 Difference]: With dead ends: 164 [2019-11-16 00:42:43,499 INFO L226 Difference]: Without dead ends: 164 [2019-11-16 00:42:43,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:42:43,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-16 00:42:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2019-11-16 00:42:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-16 00:42:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2019-11-16 00:42:43,505 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 61 [2019-11-16 00:42:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:43,505 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2019-11-16 00:42:43,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:42:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2019-11-16 00:42:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-16 00:42:43,506 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:43,506 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:43,506 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:42:43,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:43,507 INFO L82 PathProgramCache]: Analyzing trace with hash 8357676, now seen corresponding path program 3 times [2019-11-16 00:42:43,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:43,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542722349] [2019-11-16 00:42:43,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:43,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:43,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:42:43,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542722349] [2019-11-16 00:42:43,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991235721] [2019-11-16 00:42:43,691 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:43,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:42:43,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:42:43,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:43,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:42:44,046 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:42:44,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-16 00:42:44,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973905591] [2019-11-16 00:42:44,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-16 00:42:44,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:44,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:42:44,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:42:44,048 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand 17 states. [2019-11-16 00:42:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:44,579 INFO L93 Difference]: Finished difference Result 159 states and 172 transitions. [2019-11-16 00:42:44,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:42:44,579 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2019-11-16 00:42:44,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:44,580 INFO L225 Difference]: With dead ends: 159 [2019-11-16 00:42:44,580 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:42:44,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:42:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:42:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2019-11-16 00:42:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:42:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2019-11-16 00:42:44,585 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 62 [2019-11-16 00:42:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:44,586 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2019-11-16 00:42:44,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-16 00:42:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2019-11-16 00:42:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:42:44,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:44,587 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:44,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:44,791 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:42:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash 978437812, now seen corresponding path program 4 times [2019-11-16 00:42:44,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:44,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409025150] [2019-11-16 00:42:44,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:44,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:44,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-16 00:42:44,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409025150] [2019-11-16 00:42:44,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170232571] [2019-11-16 00:42:44,924 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:45,107 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:42:45,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:42:45,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:42:45,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-16 00:42:45,146 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:42:45,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-11-16 00:42:45,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491283563] [2019-11-16 00:42:45,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:42:45,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:45,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:42:45,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:42:45,148 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 10 states. [2019-11-16 00:42:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:45,506 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2019-11-16 00:42:45,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:42:45,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-11-16 00:42:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:45,508 INFO L225 Difference]: With dead ends: 132 [2019-11-16 00:42:45,508 INFO L226 Difference]: Without dead ends: 123 [2019-11-16 00:42:45,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:42:45,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-16 00:42:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2019-11-16 00:42:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-16 00:42:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-16 00:42:45,513 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 63 [2019-11-16 00:42:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:45,513 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-16 00:42:45,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:42:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-16 00:42:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:42:45,514 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:45,514 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:45,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:45,718 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:42:45,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:45,718 INFO L82 PathProgramCache]: Analyzing trace with hash -3248052, now seen corresponding path program 1 times [2019-11-16 00:42:45,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:45,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135068960] [2019-11-16 00:42:45,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:45,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:45,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:42:45,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135068960] [2019-11-16 00:42:45,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370522205] [2019-11-16 00:42:45,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:46,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:42:46,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:42:46,046 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:42:46,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-16 00:42:46,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651815872] [2019-11-16 00:42:46,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:42:46,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:46,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:42:46,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:42:46,047 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 10 states. [2019-11-16 00:42:46,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:46,369 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2019-11-16 00:42:46,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:42:46,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-11-16 00:42:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:46,370 INFO L225 Difference]: With dead ends: 136 [2019-11-16 00:42:46,370 INFO L226 Difference]: Without dead ends: 136 [2019-11-16 00:42:46,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:42:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-16 00:42:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2019-11-16 00:42:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-16 00:42:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2019-11-16 00:42:46,375 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 64 [2019-11-16 00:42:46,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:46,376 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2019-11-16 00:42:46,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:42:46,377 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2019-11-16 00:42:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:42:46,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:46,378 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:46,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:46,586 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:42:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:46,587 INFO L82 PathProgramCache]: Analyzing trace with hash -15828020, now seen corresponding path program 1 times [2019-11-16 00:42:46,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:46,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90893379] [2019-11-16 00:42:46,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:46,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:46,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:42:46,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90893379] [2019-11-16 00:42:46,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818340181] [2019-11-16 00:42:46,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:46,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:42:46,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:42:46,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:42:46,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-11-16 00:42:46,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661264768] [2019-11-16 00:42:46,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:46,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:46,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:46,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:42:46,928 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 6 states. [2019-11-16 00:42:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:47,008 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-11-16 00:42:47,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:47,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-11-16 00:42:47,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:47,009 INFO L225 Difference]: With dead ends: 114 [2019-11-16 00:42:47,010 INFO L226 Difference]: Without dead ends: 111 [2019-11-16 00:42:47,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:42:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-16 00:42:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-16 00:42:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-16 00:42:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-16 00:42:47,013 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 72 [2019-11-16 00:42:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:47,014 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-16 00:42:47,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-16 00:42:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:42:47,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:47,015 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:47,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:47,220 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:42:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:47,220 INFO L82 PathProgramCache]: Analyzing trace with hash -888935342, now seen corresponding path program 1 times [2019-11-16 00:42:47,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:47,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483443941] [2019-11-16 00:42:47,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:47,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:47,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:42:48,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483443941] [2019-11-16 00:42:48,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713648810] [2019-11-16 00:42:48,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:48,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 93 conjunts are in the unsatisfiable core [2019-11-16 00:42:48,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:48,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:48,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:42:48,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:48,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:48,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:48,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-16 00:42:48,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:42:48,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:48,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:48,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:48,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-16 00:42:48,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:48,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2019-11-16 00:42:48,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:42:48,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:42:48,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:42:48,976 INFO L567 ElimStorePlain]: treesize reduction 25, result has 44.4 percent of original size [2019-11-16 00:42:48,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:42:48,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-11-16 00:42:49,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-11-16 00:42:49,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:49,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:49,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:42:49,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-11-16 00:42:50,082 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-11-16 00:42:50,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:50,119 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-16 00:42:50,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2019-11-16 00:42:50,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:50,133 INFO L567 ElimStorePlain]: treesize reduction 34, result has 40.4 percent of original size [2019-11-16 00:42:50,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:42:50,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2019-11-16 00:42:50,393 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_40|], 6=[|v_#memory_$Pointer$.base_BEFORE_CALL_10|]} [2019-11-16 00:42:50,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 81 [2019-11-16 00:42:50,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:50,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:50,457 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:50,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 155 [2019-11-16 00:42:50,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:42:50,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:42:50,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:42:50,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-16 00:42:50,503 INFO L567 ElimStorePlain]: treesize reduction 192, result has 29.2 percent of original size [2019-11-16 00:42:50,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:42:50,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:70 [2019-11-16 00:42:50,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-16 00:42:50,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:50,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:50,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-16 00:42:50,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:50,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:50,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:50,951 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2019-11-16 00:42:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2019-11-16 00:42:51,074 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:42:51,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 59 [2019-11-16 00:42:51,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953914462] [2019-11-16 00:42:51,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-11-16 00:42:51,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:51,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-11-16 00:42:51,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3238, Unknown=1, NotChecked=114, Total=3540 [2019-11-16 00:42:51,076 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 60 states. [2019-11-16 00:42:56,914 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-11-16 00:42:57,397 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-16 00:42:59,556 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-11-16 00:43:00,990 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-16 00:43:01,530 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-11-16 00:43:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:03,558 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2019-11-16 00:43:03,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:43:03,558 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 75 [2019-11-16 00:43:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:03,560 INFO L225 Difference]: With dead ends: 137 [2019-11-16 00:43:03,560 INFO L226 Difference]: Without dead ends: 137 [2019-11-16 00:43:03,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=519, Invalid=6290, Unknown=1, NotChecked=162, Total=6972 [2019-11-16 00:43:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-16 00:43:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2019-11-16 00:43:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-16 00:43:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-11-16 00:43:03,566 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 75 [2019-11-16 00:43:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:03,566 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-11-16 00:43:03,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-11-16 00:43:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-11-16 00:43:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:43:03,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:03,567 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:03,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:03,771 INFO L410 AbstractCegarLoop]: === Iteration 26 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:43:03,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:03,771 INFO L82 PathProgramCache]: Analyzing trace with hash -888935343, now seen corresponding path program 1 times [2019-11-16 00:43:03,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:03,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552894043] [2019-11-16 00:43:03,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:03,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:03,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:43:04,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552894043] [2019-11-16 00:43:04,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060027435] [2019-11-16 00:43:04,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:04,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-16 00:43:04,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:04,801 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:04,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:43:04,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:04,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:04,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:04,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-16 00:43:04,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:43:04,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:04,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:04,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:04,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-16 00:43:04,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:04,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2019-11-16 00:43:04,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:04,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:04,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:04,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:04,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-11-16 00:43:06,011 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-11-16 00:43:06,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:06,043 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-16 00:43:06,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2019-11-16 00:43:06,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:06,056 INFO L567 ElimStorePlain]: treesize reduction 34, result has 40.4 percent of original size [2019-11-16 00:43:06,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:06,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2019-11-16 00:43:07,313 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-16 00:43:07,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:07,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 117 [2019-11-16 00:43:07,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:07,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:07,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:07,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:07,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:07,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:43:07,385 INFO L567 ElimStorePlain]: treesize reduction 144, result has 26.9 percent of original size [2019-11-16 00:43:07,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-16 00:43:07,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:48 [2019-11-16 00:43:07,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:43:07,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:07,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:07,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:07,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-11-16 00:43:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2019-11-16 00:43:07,573 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:43:07,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 48 [2019-11-16 00:43:07,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039173226] [2019-11-16 00:43:07,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-11-16 00:43:07,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:07,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-11-16 00:43:07,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2127, Unknown=1, NotChecked=92, Total=2352 [2019-11-16 00:43:07,574 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 49 states. [2019-11-16 00:43:11,639 WARN L191 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-11-16 00:43:12,949 WARN L191 SmtUtils]: Spent 937.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-16 00:43:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:14,091 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2019-11-16 00:43:14,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-16 00:43:14,092 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 75 [2019-11-16 00:43:14,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:14,092 INFO L225 Difference]: With dead ends: 134 [2019-11-16 00:43:14,092 INFO L226 Difference]: Without dead ends: 134 [2019-11-16 00:43:14,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=387, Invalid=4446, Unknown=1, NotChecked=136, Total=4970 [2019-11-16 00:43:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-16 00:43:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2019-11-16 00:43:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-16 00:43:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-16 00:43:14,096 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 75 [2019-11-16 00:43:14,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:14,096 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-16 00:43:14,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-11-16 00:43:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-16 00:43:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-16 00:43:14,097 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:14,097 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:14,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:14,298 INFO L410 AbstractCegarLoop]: === Iteration 27 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:43:14,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:14,298 INFO L82 PathProgramCache]: Analyzing trace with hash 497321167, now seen corresponding path program 2 times [2019-11-16 00:43:14,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:14,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354891495] [2019-11-16 00:43:14,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:14,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:14,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:43:14,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354891495] [2019-11-16 00:43:14,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836351386] [2019-11-16 00:43:14,441 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:14,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:43:14,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:43:14,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:43:14,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:43:14,642 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:43:14,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-11-16 00:43:14,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319801324] [2019-11-16 00:43:14,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:43:14,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:14,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:43:14,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:43:14,643 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 10 states. [2019-11-16 00:43:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:15,055 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2019-11-16 00:43:15,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:43:15,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-11-16 00:43:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:15,057 INFO L225 Difference]: With dead ends: 118 [2019-11-16 00:43:15,057 INFO L226 Difference]: Without dead ends: 118 [2019-11-16 00:43:15,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:43:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-16 00:43:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2019-11-16 00:43:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-16 00:43:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-11-16 00:43:15,061 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 78 [2019-11-16 00:43:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:15,061 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-11-16 00:43:15,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:43:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-11-16 00:43:15,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:43:15,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:15,062 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:15,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:15,270 INFO L410 AbstractCegarLoop]: === Iteration 28 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:43:15,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:15,270 INFO L82 PathProgramCache]: Analyzing trace with hash -144969027, now seen corresponding path program 1 times [2019-11-16 00:43:15,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:15,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835551319] [2019-11-16 00:43:15,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:15,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:15,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-16 00:43:15,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835551319] [2019-11-16 00:43:15,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895789857] [2019-11-16 00:43:15,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:15,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:43:15,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:43:15,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:43:15,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-11-16 00:43:15,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679339771] [2019-11-16 00:43:15,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:43:15,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:15,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:43:15,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:43:15,651 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 6 states. [2019-11-16 00:43:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:15,711 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-11-16 00:43:15,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:43:15,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-16 00:43:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:15,712 INFO L225 Difference]: With dead ends: 109 [2019-11-16 00:43:15,712 INFO L226 Difference]: Without dead ends: 105 [2019-11-16 00:43:15,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:43:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-16 00:43:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-11-16 00:43:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-16 00:43:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2019-11-16 00:43:15,716 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 86 [2019-11-16 00:43:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:15,716 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2019-11-16 00:43:15,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:43:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2019-11-16 00:43:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:43:15,717 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:15,717 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:15,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:15,922 INFO L410 AbstractCegarLoop]: === Iteration 29 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:43:15,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:15,922 INFO L82 PathProgramCache]: Analyzing trace with hash -55961056, now seen corresponding path program 1 times [2019-11-16 00:43:15,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:15,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280256869] [2019-11-16 00:43:15,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:15,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:15,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-16 00:43:16,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280256869] [2019-11-16 00:43:16,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053553823] [2019-11-16 00:43:16,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:16,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:43:16,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:16,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-16 00:43:16,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:16,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:16,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:16,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-11-16 00:43:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-16 00:43:16,357 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:43:16,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 13 [2019-11-16 00:43:16,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777935253] [2019-11-16 00:43:16,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:43:16,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:16,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:43:16,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:43:16,359 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 14 states. [2019-11-16 00:43:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:17,448 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-11-16 00:43:17,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:43:17,448 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-11-16 00:43:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:17,449 INFO L225 Difference]: With dead ends: 125 [2019-11-16 00:43:17,450 INFO L226 Difference]: Without dead ends: 125 [2019-11-16 00:43:17,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:43:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-16 00:43:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2019-11-16 00:43:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-16 00:43:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-11-16 00:43:17,453 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 89 [2019-11-16 00:43:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:17,453 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-11-16 00:43:17,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:43:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-11-16 00:43:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:43:17,456 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:17,456 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:17,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:17,657 INFO L410 AbstractCegarLoop]: === Iteration 30 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:43:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:17,657 INFO L82 PathProgramCache]: Analyzing trace with hash -55961055, now seen corresponding path program 1 times [2019-11-16 00:43:17,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:17,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882977045] [2019-11-16 00:43:17,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:17,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:17,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:43:18,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882977045] [2019-11-16 00:43:18,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191757878] [2019-11-16 00:43:18,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:18,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 124 conjunts are in the unsatisfiable core [2019-11-16 00:43:18,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:19,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:43:19,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-16 00:43:19,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:43:19,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:43:19,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-16 00:43:19,152 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 57 [2019-11-16 00:43:19,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:19,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-16 00:43:19,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:19,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:19,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2019-11-16 00:43:20,586 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-11-16 00:43:20,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,621 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-16 00:43:20,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 54 [2019-11-16 00:43:20,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,650 INFO L567 ElimStorePlain]: treesize reduction 34, result has 64.9 percent of original size [2019-11-16 00:43:20,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:20,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-11-16 00:43:20,654 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:20,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:41 [2019-11-16 00:43:21,745 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) |c_#memory_$Pointer$.offset|)) is different from true [2019-11-16 00:43:21,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 49 [2019-11-16 00:43:21,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:21,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:21,768 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:21,805 INFO L567 ElimStorePlain]: treesize reduction 12, result has 77.4 percent of original size [2019-11-16 00:43:21,824 INFO L341 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2019-11-16 00:43:21,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2019-11-16 00:43:21,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:21,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:11 [2019-11-16 00:43:22,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-16 00:43:22,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:22,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:22,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-16 00:43:22,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:22,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:22,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:22,690 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2019-11-16 00:43:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-11-16 00:43:22,808 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:43:22,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 61 [2019-11-16 00:43:22,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699240929] [2019-11-16 00:43:22,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-11-16 00:43:22,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:22,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-11-16 00:43:22,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3344, Unknown=2, NotChecked=234, Total=3782 [2019-11-16 00:43:22,810 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 62 states. [2019-11-16 00:43:26,488 WARN L191 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2019-11-16 00:43:28,791 WARN L191 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-11-16 00:43:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:30,663 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-11-16 00:43:30,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-16 00:43:30,664 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 89 [2019-11-16 00:43:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:30,665 INFO L225 Difference]: With dead ends: 125 [2019-11-16 00:43:30,665 INFO L226 Difference]: Without dead ends: 125 [2019-11-16 00:43:30,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1903 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=622, Invalid=7756, Unknown=2, NotChecked=362, Total=8742 [2019-11-16 00:43:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-16 00:43:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2019-11-16 00:43:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-16 00:43:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2019-11-16 00:43:30,670 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 89 [2019-11-16 00:43:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:30,670 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2019-11-16 00:43:30,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-11-16 00:43:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2019-11-16 00:43:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:43:30,671 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:30,671 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:30,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:30,872 INFO L410 AbstractCegarLoop]: === Iteration 31 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:43:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:30,872 INFO L82 PathProgramCache]: Analyzing trace with hash -23428673, now seen corresponding path program 1 times [2019-11-16 00:43:30,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:30,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947045584] [2019-11-16 00:43:30,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:30,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:30,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-16 00:43:31,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947045584] [2019-11-16 00:43:31,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:31,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-16 00:43:31,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105474889] [2019-11-16 00:43:31,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:43:31,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:31,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:43:31,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:43:31,132 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 16 states. [2019-11-16 00:43:31,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:31,790 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2019-11-16 00:43:31,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:43:31,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-11-16 00:43:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:31,791 INFO L225 Difference]: With dead ends: 113 [2019-11-16 00:43:31,791 INFO L226 Difference]: Without dead ends: 111 [2019-11-16 00:43:31,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:43:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-16 00:43:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2019-11-16 00:43:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-16 00:43:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-11-16 00:43:31,795 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 89 [2019-11-16 00:43:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:31,795 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-11-16 00:43:31,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:43:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-11-16 00:43:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-16 00:43:31,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:31,796 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:31,796 INFO L410 AbstractCegarLoop]: === Iteration 32 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:43:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:31,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1734794134, now seen corresponding path program 1 times [2019-11-16 00:43:31,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:31,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352608900] [2019-11-16 00:43:31,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:31,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:31,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-16 00:43:32,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352608900] [2019-11-16 00:43:32,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:32,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-16 00:43:32,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181243916] [2019-11-16 00:43:32,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:43:32,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:32,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:43:32,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:43:32,053 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 15 states. [2019-11-16 00:43:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:32,582 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-11-16 00:43:32,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:43:32,583 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-11-16 00:43:32,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:32,583 INFO L225 Difference]: With dead ends: 109 [2019-11-16 00:43:32,584 INFO L226 Difference]: Without dead ends: 109 [2019-11-16 00:43:32,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:43:32,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-16 00:43:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-11-16 00:43:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-16 00:43:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2019-11-16 00:43:32,587 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 90 [2019-11-16 00:43:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:32,587 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2019-11-16 00:43:32,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:43:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2019-11-16 00:43:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:43:32,588 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:32,588 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:32,588 INFO L410 AbstractCegarLoop]: === Iteration 33 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:43:32,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:32,588 INFO L82 PathProgramCache]: Analyzing trace with hash -688429937, now seen corresponding path program 1 times [2019-11-16 00:43:32,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:32,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351752676] [2019-11-16 00:43:32,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:32,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:32,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-16 00:43:33,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351752676] [2019-11-16 00:43:33,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027024853] [2019-11-16 00:43:33,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:33,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 90 conjunts are in the unsatisfiable core [2019-11-16 00:43:33,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:33,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-16 00:43:33,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:33,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:33,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:33,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:43:33,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:33,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:43:33,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:33,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:33,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:33,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-11-16 00:43:34,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:43:34,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:34,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:34,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:34,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-16 00:43:34,178 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:34,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-16 00:43:34,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:34,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:34,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:43:34,196 INFO L567 ElimStorePlain]: treesize reduction 34, result has 46.0 percent of original size [2019-11-16 00:43:34,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:34,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-11-16 00:43:34,397 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:34,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-16 00:43:34,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:34,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:34,398 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:34,408 INFO L567 ElimStorePlain]: treesize reduction 12, result has 52.0 percent of original size [2019-11-16 00:43:34,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:34,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2019-11-16 00:43:35,336 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-11-16 00:43:35,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:35,390 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-16 00:43:35,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 52 [2019-11-16 00:43:35,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:35,411 INFO L567 ElimStorePlain]: treesize reduction 34, result has 48.5 percent of original size [2019-11-16 00:43:35,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:35,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-11-16 00:43:35,420 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:35,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-16 00:43:35,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:35,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:35,421 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:35,431 INFO L567 ElimStorePlain]: treesize reduction 12, result has 52.0 percent of original size [2019-11-16 00:43:35,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:35,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2019-11-16 00:43:37,020 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))) |c_#memory_$Pointer$.base|)) is different from true [2019-11-16 00:43:37,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:37,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 117 [2019-11-16 00:43:37,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:37,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:37,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:37,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:37,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:37,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:37,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:37,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:37,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-11-16 00:43:37,088 INFO L567 ElimStorePlain]: treesize reduction 363, result has 8.8 percent of original size [2019-11-16 00:43:37,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:37,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:18 [2019-11-16 00:43:37,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:43:37,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:43:37,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:37,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:37,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-11-16 00:43:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2019-11-16 00:43:37,654 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:43:37,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 51 [2019-11-16 00:43:37,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215481022] [2019-11-16 00:43:37,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-16 00:43:37,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:37,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-16 00:43:37,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2296, Unknown=2, NotChecked=194, Total=2652 [2019-11-16 00:43:37,656 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand 52 states. [2019-11-16 00:43:40,309 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-16 00:43:42,613 WARN L191 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-16 00:43:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:43,837 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2019-11-16 00:43:43,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:43:43,837 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 92 [2019-11-16 00:43:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:43,838 INFO L225 Difference]: With dead ends: 110 [2019-11-16 00:43:43,838 INFO L226 Difference]: Without dead ends: 110 [2019-11-16 00:43:43,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=458, Invalid=4950, Unknown=2, NotChecked=290, Total=5700 [2019-11-16 00:43:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-16 00:43:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-11-16 00:43:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-16 00:43:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2019-11-16 00:43:43,843 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 92 [2019-11-16 00:43:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:43,843 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2019-11-16 00:43:43,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-16 00:43:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2019-11-16 00:43:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:43:43,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:43,844 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:44,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:44,045 INFO L410 AbstractCegarLoop]: === Iteration 34 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:43:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash 186928499, now seen corresponding path program 1 times [2019-11-16 00:43:44,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:44,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346630426] [2019-11-16 00:43:44,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:44,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:44,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-16 00:43:44,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346630426] [2019-11-16 00:43:44,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485295618] [2019-11-16 00:43:44,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:44,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 95 conjunts are in the unsatisfiable core [2019-11-16 00:43:44,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:45,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:45,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:43:45,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:45,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:45,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:45,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-16 00:43:45,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:43:45,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:45,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:45,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:45,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-16 00:43:45,235 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:45,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 46 [2019-11-16 00:43:45,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:45,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:45,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:45,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:45,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-11-16 00:43:46,318 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-11-16 00:43:46,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:46,349 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-16 00:43:46,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2019-11-16 00:43:46,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:46,365 INFO L567 ElimStorePlain]: treesize reduction 34, result has 43.3 percent of original size [2019-11-16 00:43:46,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:46,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:23 [2019-11-16 00:43:47,807 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))) |c_#memory_$Pointer$.base|)) is different from true [2019-11-16 00:43:47,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:47,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 179 [2019-11-16 00:43:47,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:47,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:47,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 11 xjuncts. [2019-11-16 00:43:48,043 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 21 [2019-11-16 00:43:48,043 INFO L567 ElimStorePlain]: treesize reduction 3475, result has 1.1 percent of original size [2019-11-16 00:43:48,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:48,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:33 [2019-11-16 00:43:50,050 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_26 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_26) 0) v_main_~s~0.base_BEFORE_CALL_26))) is different from true [2019-11-16 00:43:52,074 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_27 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_27 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_27) 0)))) is different from true [2019-11-16 00:43:54,119 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_28 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_28 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_28) 0)))) is different from true [2019-11-16 00:44:06,165 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2019-11-16 00:44:08,215 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-16 00:44:10,282 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-16 00:44:12,337 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-16 00:44:14,396 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-16 00:44:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 9 not checked. [2019-11-16 00:44:14,419 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:14,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 56 [2019-11-16 00:44:14,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482509407] [2019-11-16 00:44:14,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-11-16 00:44:14,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:14,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-11-16 00:44:14,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2399, Unknown=10, NotChecked=510, Total=3080 [2019-11-16 00:44:14,421 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 56 states. [2019-11-16 00:44:16,868 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-16 00:44:19,846 WARN L191 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-16 00:44:31,971 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-16 00:44:50,287 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-16 00:44:52,387 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-16 00:44:54,455 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-16 00:44:58,545 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-16 00:45:02,664 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-11-16 00:45:06,807 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-11-16 00:45:08,924 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-16 00:45:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:45:09,127 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2019-11-16 00:45:09,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-16 00:45:09,128 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 95 [2019-11-16 00:45:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:45:09,128 INFO L225 Difference]: With dead ends: 110 [2019-11-16 00:45:09,129 INFO L226 Difference]: Without dead ends: 105 [2019-11-16 00:45:09,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 82.9s TimeCoverageRelationStatistics Valid=424, Invalid=4694, Unknown=14, NotChecked=720, Total=5852 [2019-11-16 00:45:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-16 00:45:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-11-16 00:45:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-16 00:45:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-11-16 00:45:09,132 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 95 [2019-11-16 00:45:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:45:09,133 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-11-16 00:45:09,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-11-16 00:45:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-11-16 00:45:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:45:09,133 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:45:09,134 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:45:09,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:45:09,338 INFO L410 AbstractCegarLoop]: === Iteration 35 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:45:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:45:09,338 INFO L82 PathProgramCache]: Analyzing trace with hash -547271099, now seen corresponding path program 1 times [2019-11-16 00:45:09,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:45:09,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409968421] [2019-11-16 00:45:09,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:45:09,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:45:09,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:45:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:45:10,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409968421] [2019-11-16 00:45:10,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937166202] [2019-11-16 00:45:10,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:45:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:10,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 137 conjunts are in the unsatisfiable core [2019-11-16 00:45:10,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:45:11,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:11,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:45:11,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:11,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:11,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:11,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-16 00:45:11,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:45:11,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:11,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:11,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:45:11,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:11,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:11,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:11,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-11-16 00:45:11,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:11,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:11,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:45:11,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:11,288 INFO L567 ElimStorePlain]: treesize reduction 3, result has 95.5 percent of original size [2019-11-16 00:45:11,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:45:11,301 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:11,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 55 [2019-11-16 00:45:11,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:11,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:11,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:11,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:11,333 INFO L567 ElimStorePlain]: treesize reduction 38, result has 50.6 percent of original size [2019-11-16 00:45:11,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:11,334 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:41 [2019-11-16 00:45:12,953 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2019-11-16 00:45:12,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:12,965 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:12,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 48 [2019-11-16 00:45:12,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:12,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:12,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:12,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-11-16 00:45:12,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:12,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:12,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:12,993 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:49 [2019-11-16 00:45:14,331 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|)) (.cse1 (+ sll_circular_update_at_~head.offset 4))) (and (<= (select (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|)))) is different from true [2019-11-16 00:45:14,352 INFO L341 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2019-11-16 00:45:14,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 48 [2019-11-16 00:45:14,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:14,382 INFO L567 ElimStorePlain]: treesize reduction 10, result has 89.7 percent of original size [2019-11-16 00:45:14,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:14,388 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:14,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 63 [2019-11-16 00:45:14,389 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:14,409 INFO L567 ElimStorePlain]: treesize reduction 28, result has 66.7 percent of original size [2019-11-16 00:45:14,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:14,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:118, output treesize:49 [2019-11-16 00:45:15,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:15,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 64 [2019-11-16 00:45:15,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:15,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:15,122 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:15,170 INFO L567 ElimStorePlain]: treesize reduction 12, result has 80.0 percent of original size [2019-11-16 00:45:15,177 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:15,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-11-16 00:45:15,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:15,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:15,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:15,194 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:23 [2019-11-16 00:45:15,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:15,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:15,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 2 not checked. [2019-11-16 00:45:15,457 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:45:15,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 55 [2019-11-16 00:45:15,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642668258] [2019-11-16 00:45:15,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-16 00:45:15,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:45:15,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-16 00:45:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2592, Unknown=2, NotChecked=206, Total=2970 [2019-11-16 00:45:15,459 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 55 states. [2019-11-16 00:45:19,986 WARN L191 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2019-11-16 00:45:23,812 WARN L191 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2019-11-16 00:45:24,775 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-16 00:45:24,947 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-16 00:45:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:45:25,273 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2019-11-16 00:45:25,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:45:25,273 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 95 [2019-11-16 00:45:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:45:25,274 INFO L225 Difference]: With dead ends: 96 [2019-11-16 00:45:25,274 INFO L226 Difference]: Without dead ends: 96 [2019-11-16 00:45:25,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 74 SyntacticMatches, 13 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=488, Invalid=5218, Unknown=2, NotChecked=298, Total=6006 [2019-11-16 00:45:25,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-16 00:45:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-16 00:45:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-16 00:45:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-11-16 00:45:25,277 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 95 [2019-11-16 00:45:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:45:25,278 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-11-16 00:45:25,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-16 00:45:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-11-16 00:45:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:45:25,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:45:25,279 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:45:25,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:45:25,483 INFO L410 AbstractCegarLoop]: === Iteration 36 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:45:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:45:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1941559211, now seen corresponding path program 1 times [2019-11-16 00:45:25,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:45:25,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548819366] [2019-11-16 00:45:25,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:45:25,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:45:25,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:45:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:45:26,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548819366] [2019-11-16 00:45:26,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242053954] [2019-11-16 00:45:26,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:45:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:26,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:45:26,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:45:26,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:26,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:26,824 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:26,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 34 [2019-11-16 00:45:26,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:26,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2019-11-16 00:45:26,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:26,859 INFO L567 ElimStorePlain]: treesize reduction 23, result has 54.0 percent of original size [2019-11-16 00:45:26,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-16 00:45:26,859 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:24 [2019-11-16 00:45:26,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:45:26,960 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:45:26,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7] total 39 [2019-11-16 00:45:26,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084692978] [2019-11-16 00:45:26,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-16 00:45:26,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:45:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-16 00:45:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1452, Unknown=0, NotChecked=0, Total=1560 [2019-11-16 00:45:26,962 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 40 states. [2019-11-16 00:45:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:45:28,932 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-11-16 00:45:28,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-16 00:45:28,932 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 97 [2019-11-16 00:45:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:45:28,933 INFO L225 Difference]: With dead ends: 95 [2019-11-16 00:45:28,933 INFO L226 Difference]: Without dead ends: 95 [2019-11-16 00:45:28,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=317, Invalid=3223, Unknown=0, NotChecked=0, Total=3540 [2019-11-16 00:45:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-16 00:45:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-11-16 00:45:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-16 00:45:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-11-16 00:45:28,936 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 97 [2019-11-16 00:45:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:45:28,936 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-11-16 00:45:28,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-16 00:45:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-11-16 00:45:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:45:28,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:45:28,937 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:45:29,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:45:29,138 INFO L410 AbstractCegarLoop]: === Iteration 37 === [sll_circular_get_data_atErr0REQUIRES_VIOLATION, sll_circular_get_data_atErr1REQUIRES_VIOLATION, sll_circular_get_data_atErr2REQUIRES_VIOLATION, sll_circular_get_data_atErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_update_atErr0REQUIRES_VIOLATION, sll_circular_update_atErr1REQUIRES_VIOLATION, sll_circular_update_atErr3REQUIRES_VIOLATION, sll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-11-16 00:45:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:45:29,138 INFO L82 PathProgramCache]: Analyzing trace with hash 837489112, now seen corresponding path program 1 times [2019-11-16 00:45:29,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:45:29,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855485133] [2019-11-16 00:45:29,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:45:29,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:45:29,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:45:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-16 00:45:30,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855485133] [2019-11-16 00:45:30,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721550790] [2019-11-16 00:45:30,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:45:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:45:30,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 111 conjunts are in the unsatisfiable core [2019-11-16 00:45:30,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:45:30,776 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:30,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 63 [2019-11-16 00:45:30,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:30,808 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-11-16 00:45:30,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:30,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2019-11-16 00:45:30,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:45:30,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:30,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:30,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:45:30,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-11-16 00:45:31,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:31,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 56 [2019-11-16 00:45:31,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:45:31,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:31,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:45:31,113 INFO L567 ElimStorePlain]: treesize reduction 43, result has 56.1 percent of original size [2019-11-16 00:45:31,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:31,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2019-11-16 00:45:31,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:45:31,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:31,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:31,430 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:31,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-16 00:45:31,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:31,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:31,431 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:31,450 INFO L567 ElimStorePlain]: treesize reduction 12, result has 66.7 percent of original size [2019-11-16 00:45:31,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:31,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:18 [2019-11-16 00:45:39,472 WARN L191 SmtUtils]: Spent 701.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-16 00:45:39,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:45:39,558 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-16 00:45:39,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 57 [2019-11-16 00:45:39,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:39,630 INFO L567 ElimStorePlain]: treesize reduction 34, result has 67.6 percent of original size [2019-11-16 00:45:39,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:39,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:90, output treesize:68 [2019-11-16 00:45:39,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:45:39,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:39,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:39,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:39,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-16 00:45:39,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:39,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:39,727 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:39,745 INFO L567 ElimStorePlain]: treesize reduction 12, result has 66.7 percent of original size [2019-11-16 00:45:39,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:39,746 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:18 [2019-11-16 00:45:52,522 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-16 00:45:52,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:52,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2019-11-16 00:45:52,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:52,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:52,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:52,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:45:52,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:45:52,641 INFO L567 ElimStorePlain]: treesize reduction 144, result has 41.5 percent of original size [2019-11-16 00:45:52,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:52,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:99, output treesize:97 [2019-11-16 00:45:52,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:45:52,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:52,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:52,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:52,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-11-16 00:45:52,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:45:52,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:52,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:52,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:52,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-11-16 00:45:53,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:45:53,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:53,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:53,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:45:53,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:45:53,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:45:53,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:45:53,285 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2019-11-16 00:46:03,356 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 16 [2019-11-16 00:46:07,459 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2019-11-16 00:46:09,542 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-11-16 00:46:11,622 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-11-16 00:46:13,709 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2019-11-16 00:46:17,798 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-16 00:46:21,985 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-16 00:46:21,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:46:21,992 INFO L375 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 28 treesize of output 21 [2019-11-16 00:46:21,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:46:22,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,015 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:46:22,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2019-11-16 00:46:22,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:22,020 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-16 00:46:22,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:46:22,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:46:22,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-16 00:46:22,047 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:76, output treesize:51 [2019-11-16 00:46:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:46:22,205 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:46:22,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 37] total 66 [2019-11-16 00:46:22,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138114414] [2019-11-16 00:46:22,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-11-16 00:46:22,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:46:22,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-11-16 00:46:22,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=4168, Unknown=24, NotChecked=0, Total=4422 [2019-11-16 00:46:22,207 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 67 states. [2019-11-16 00:46:46,981 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-11-16 00:46:50,674 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-11-16 00:46:51,758 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-16 00:46:58,128 WARN L191 SmtUtils]: Spent 809.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-16 00:47:04,061 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-11-16 00:47:09,509 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-16 00:47:14,436 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-16 00:47:17,281 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-11-16 00:47:18,451 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-11-16 00:47:19,814 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-11-16 00:47:22,177 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-16 00:47:24,290 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-16 00:47:26,395 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-16 00:47:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:47:26,549 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-11-16 00:47:26,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-16 00:47:26,550 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 101 [2019-11-16 00:47:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:47:26,550 INFO L225 Difference]: With dead ends: 94 [2019-11-16 00:47:26,550 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:47:26,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2141 ImplicationChecksByTransitivity, 75.6s TimeCoverageRelationStatistics Valid=554, Invalid=8161, Unknown=27, NotChecked=0, Total=8742 [2019-11-16 00:47:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:47:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:47:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:47:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:47:26,552 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2019-11-16 00:47:26,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:47:26,552 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:47:26,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-11-16 00:47:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:47:26,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:47:26,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:47:26,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:47:26 BoogieIcfgContainer [2019-11-16 00:47:26,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:47:26,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:47:26,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:47:26,757 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:47:26,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:32" (3/4) ... [2019-11-16 00:47:26,760 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:47:26,766 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-16 00:47:26,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-16 00:47:26,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_get_data_at [2019-11-16 00:47:26,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-16 00:47:26,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-16 00:47:26,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2019-11-16 00:47:26,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_destroy [2019-11-16 00:47:26,768 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-16 00:47:26,768 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_update_at [2019-11-16 00:47:26,768 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-11-16 00:47:26,773 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-11-16 00:47:26,773 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-16 00:47:26,774 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-16 00:47:26,823 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9ae656eb-1942-450e-8fd1-461fe2b2c5bf/bin/uautomizer/witness.graphml [2019-11-16 00:47:26,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:47:26,825 INFO L168 Benchmark]: Toolchain (without parser) took 415117.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.7 MB). Free memory was 938.1 MB in the beginning and 1.0 GB in the end (delta: -63.5 MB). Peak memory consumption was 168.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:26,825 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:47:26,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:26,826 INFO L168 Benchmark]: Boogie Preprocessor took 59.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:47:26,826 INFO L168 Benchmark]: RCFGBuilder took 706.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:26,827 INFO L168 Benchmark]: TraceAbstraction took 413772.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 37.0 MB). Peak memory consumption was 131.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:26,827 INFO L168 Benchmark]: Witness Printer took 67.08 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:47:26,828 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 506.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 706.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 413772.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 37.0 MB). Peak memory consumption was 131.9 MB. Max. memory is 11.5 GB. * Witness Printer took 67.08 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 110 locations, 27 error locations. Result: SAFE, OverallTime: 413.7s, OverallIterations: 37, TraceHistogramMax: 3, AutomataDifference: 248.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2268 SDtfs, 6526 SDslu, 11052 SDs, 0 SdLazy, 39665 SolverSat, 1413 SolverUnsat, 76 SolverUnknown, 0 SolverNotchecked, 99.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2723 GetRequests, 1525 SyntacticMatches, 45 SemanticMatches, 1153 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 11347 ImplicationChecksByTransitivity, 294.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 683 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 156.0s InterpolantComputationTime, 3620 NumberOfCodeBlocks, 3620 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 3563 ConstructedInterpolants, 260 QuantifiedInterpolants, 2565514 SizeOfPredicates, 280 NumberOfNonLiveVariables, 6993 ConjunctsInSsa, 1025 ConjunctsInUnsatCore, 57 InterpolantComputations, 19 PerfectInterpolantSequences, 895/1241 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...