./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 16891def4f6ae6ab6c00fe328146dbdee1a68356 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 23:56:14,870 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 23:56:14,872 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 23:56:14,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 23:56:14,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 23:56:14,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 23:56:14,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 23:56:14,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 23:56:14,896 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 23:56:14,897 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 23:56:14,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 23:56:14,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 23:56:14,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 23:56:14,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 23:56:14,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 23:56:14,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 23:56:14,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 23:56:14,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 23:56:14,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 23:56:14,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 23:56:14,911 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 23:56:14,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 23:56:14,915 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 23:56:14,915 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 23:56:14,916 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 23:56:14,917 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 23:56:14,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 23:56:14,919 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 23:56:14,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 23:56:14,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 23:56:14,921 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 23:56:14,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 23:56:14,923 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 23:56:14,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 23:56:14,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 23:56:14,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 23:56:14,926 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 23:56:14,941 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 23:56:14,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 23:56:14,942 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 23:56:14,942 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 23:56:14,943 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 23:56:14,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 23:56:14,943 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 23:56:14,943 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 23:56:14,943 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 23:56:14,943 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 23:56:14,944 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 23:56:14,945 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 23:56:14,945 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 23:56:14,945 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 23:56:14,945 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 23:56:14,946 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 23:56:14,946 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 23:56:14,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 23:56:14,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 23:56:14,946 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 23:56:14,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 23:56:14,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:56:14,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 23:56:14,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 23:56:14,948 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 23:56:14,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 23:56:14,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 16891def4f6ae6ab6c00fe328146dbdee1a68356 [2019-01-13 23:56:14,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 23:56:15,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 23:56:15,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 23:56:15,012 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 23:56:15,013 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 23:56:15,014 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-13 23:56:15,068 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49efab03c/dfdacb332ab641378a837eba7a68bedd/FLAGbad66cd72 [2019-01-13 23:56:15,558 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 23:56:15,559 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-13 23:56:15,572 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49efab03c/dfdacb332ab641378a837eba7a68bedd/FLAGbad66cd72 [2019-01-13 23:56:15,854 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49efab03c/dfdacb332ab641378a837eba7a68bedd [2019-01-13 23:56:15,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 23:56:15,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 23:56:15,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 23:56:15,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 23:56:15,864 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 23:56:15,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:56:15" (1/1) ... [2019-01-13 23:56:15,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff1d10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:56:15, skipping insertion in model container [2019-01-13 23:56:15,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:56:15" (1/1) ... [2019-01-13 23:56:15,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 23:56:15,927 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 23:56:16,286 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:56:16,300 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 23:56:16,448 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:56:16,506 INFO L195 MainTranslator]: Completed translation [2019-01-13 23:56:16,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:56:16 WrapperNode [2019-01-13 23:56:16,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 23:56:16,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 23:56:16,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 23:56:16,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 23:56:16,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:56:16" (1/1) ... [2019-01-13 23:56:16,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:56:16" (1/1) ... [2019-01-13 23:56:16,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:56:16" (1/1) ... [2019-01-13 23:56:16,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:56:16" (1/1) ... [2019-01-13 23:56:16,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:56:16" (1/1) ... [2019-01-13 23:56:16,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:56:16" (1/1) ... [2019-01-13 23:56:16,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:56:16" (1/1) ... [2019-01-13 23:56:16,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 23:56:16,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 23:56:16,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 23:56:16,580 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 23:56:16,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:56:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-13 23:56:16,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 23:56:16,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 23:56:16,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 23:56:16,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 23:56:16,637 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-13 23:56:16,638 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-13 23:56:16,638 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-01-13 23:56:16,638 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-01-13 23:56:16,638 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-01-13 23:56:16,638 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-01-13 23:56:16,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 23:56:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 23:56:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 23:56:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 23:56:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 23:56:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 23:56:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 23:56:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 23:56:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 23:56:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 23:56:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 23:56:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 23:56:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 23:56:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 23:56:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 23:56:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 23:56:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 23:56:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 23:56:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 23:56:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 23:56:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 23:56:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 23:56:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 23:56:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 23:56:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 23:56:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 23:56:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 23:56:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 23:56:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 23:56:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 23:56:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 23:56:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 23:56:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 23:56:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 23:56:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 23:56:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 23:56:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 23:56:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 23:56:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 23:56:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 23:56:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 23:56:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 23:56:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 23:56:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 23:56:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 23:56:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 23:56:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 23:56:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 23:56:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 23:56:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 23:56:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 23:56:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 23:56:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 23:56:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 23:56:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 23:56:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 23:56:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 23:56:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 23:56:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 23:56:16,652 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-13 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-13 23:56:16,653 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 23:56:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 23:56:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-13 23:56:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 23:56:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 23:56:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 23:56:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 23:56:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 23:56:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 23:56:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 23:56:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 23:56:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 23:56:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 23:56:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 23:56:16,663 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 23:56:16,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 23:56:16,665 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 23:56:16,665 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 23:56:16,665 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 23:56:16,665 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 23:56:16,666 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 23:56:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 23:56:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 23:56:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 23:56:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 23:56:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 23:56:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 23:56:16,668 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 23:56:16,668 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 23:56:16,668 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 23:56:16,669 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 23:56:16,669 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 23:56:16,669 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 23:56:16,669 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 23:56:16,669 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 23:56:16,669 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-13 23:56:16,669 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-13 23:56:16,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 23:56:16,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 23:56:16,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 23:56:16,671 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-01-13 23:56:16,672 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-01-13 23:56:16,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 23:56:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 23:56:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-01-13 23:56:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 23:56:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-01-13 23:56:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 23:56:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 23:56:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 23:56:17,255 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-13 23:56:17,745 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 23:56:17,745 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-13 23:56:17,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:56:17 BoogieIcfgContainer [2019-01-13 23:56:17,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 23:56:17,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 23:56:17,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 23:56:17,751 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 23:56:17,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 11:56:15" (1/3) ... [2019-01-13 23:56:17,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab17337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:56:17, skipping insertion in model container [2019-01-13 23:56:17,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:56:16" (2/3) ... [2019-01-13 23:56:17,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab17337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:56:17, skipping insertion in model container [2019-01-13 23:56:17,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:56:17" (3/3) ... [2019-01-13 23:56:17,755 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-13 23:56:17,763 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 23:56:17,772 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2019-01-13 23:56:17,785 INFO L257 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2019-01-13 23:56:17,810 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 23:56:17,810 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 23:56:17,811 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 23:56:17,812 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 23:56:17,812 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 23:56:17,812 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 23:56:17,812 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 23:56:17,812 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 23:56:17,813 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 23:56:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-13 23:56:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 23:56:17,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:17,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:17,849 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1471092252, now seen corresponding path program 1 times [2019-01-13 23:56:17,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:17,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:17,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:56:18,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:18,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 23:56:18,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 23:56:18,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 23:56:18,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:56:18,075 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 3 states. [2019-01-13 23:56:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:18,463 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2019-01-13 23:56:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 23:56:18,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-13 23:56:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:18,475 INFO L225 Difference]: With dead ends: 110 [2019-01-13 23:56:18,475 INFO L226 Difference]: Without dead ends: 103 [2019-01-13 23:56:18,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:56:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-13 23:56:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-13 23:56:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-13 23:56:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-01-13 23:56:18,521 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 12 [2019-01-13 23:56:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:18,521 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-01-13 23:56:18,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 23:56:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-01-13 23:56:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 23:56:18,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:18,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:18,523 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:18,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:18,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1471092251, now seen corresponding path program 1 times [2019-01-13 23:56:18,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:18,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:18,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:18,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:56:18,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:18,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 23:56:18,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 23:56:18,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 23:56:18,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:56:18,711 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 3 states. [2019-01-13 23:56:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:19,083 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-01-13 23:56:19,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 23:56:19,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-13 23:56:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:19,088 INFO L225 Difference]: With dead ends: 100 [2019-01-13 23:56:19,088 INFO L226 Difference]: Without dead ends: 100 [2019-01-13 23:56:19,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:56:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-13 23:56:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-13 23:56:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:56:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-01-13 23:56:19,101 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 12 [2019-01-13 23:56:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:19,101 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-01-13 23:56:19,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 23:56:19,102 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-01-13 23:56:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 23:56:19,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:19,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:19,103 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:19,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:19,104 INFO L82 PathProgramCache]: Analyzing trace with hash 322104282, now seen corresponding path program 1 times [2019-01-13 23:56:19,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:19,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:19,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:19,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:19,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:56:19,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:19,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:56:19,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:56:19,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:56:19,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:56:19,227 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 5 states. [2019-01-13 23:56:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:19,304 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-01-13 23:56:19,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:56:19,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-13 23:56:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:19,307 INFO L225 Difference]: With dead ends: 101 [2019-01-13 23:56:19,307 INFO L226 Difference]: Without dead ends: 101 [2019-01-13 23:56:19,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:56:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-13 23:56:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-13 23:56:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-13 23:56:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-01-13 23:56:19,318 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 20 [2019-01-13 23:56:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:19,320 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-01-13 23:56:19,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:56:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-01-13 23:56:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 23:56:19,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:19,322 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:19,322 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1342193716, now seen corresponding path program 1 times [2019-01-13 23:56:19,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:19,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:19,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:56:19,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:19,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:56:19,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:56:19,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:56:19,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:56:19,523 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-01-13 23:56:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:19,855 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-01-13 23:56:19,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:56:19,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-13 23:56:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:19,861 INFO L225 Difference]: With dead ends: 101 [2019-01-13 23:56:19,861 INFO L226 Difference]: Without dead ends: 101 [2019-01-13 23:56:19,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:56:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-13 23:56:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-13 23:56:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 23:56:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-01-13 23:56:19,873 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 30 [2019-01-13 23:56:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:19,874 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-01-13 23:56:19,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:56:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-01-13 23:56:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 23:56:19,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:19,875 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:19,876 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:19,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1342193717, now seen corresponding path program 1 times [2019-01-13 23:56:19,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:19,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:19,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-13 23:56:19,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:19,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:56:19,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:56:19,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:56:19,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:56:19,999 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-01-13 23:56:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:20,262 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2019-01-13 23:56:20,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:56:20,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-13 23:56:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:20,266 INFO L225 Difference]: With dead ends: 100 [2019-01-13 23:56:20,266 INFO L226 Difference]: Without dead ends: 100 [2019-01-13 23:56:20,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:56:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-13 23:56:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-01-13 23:56:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-13 23:56:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-01-13 23:56:20,274 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 30 [2019-01-13 23:56:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:20,274 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-01-13 23:56:20,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:56:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-01-13 23:56:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 23:56:20,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:20,276 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:20,276 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:20,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1357973588, now seen corresponding path program 1 times [2019-01-13 23:56:20,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:20,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:20,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:20,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:20,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:56:20,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:56:20,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:56:20,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:20,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:56:22,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 23:56:22,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:22,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:22,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-13 23:56:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:56:22,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:56:22,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-13 23:56:22,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:56:22,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:56:22,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2019-01-13 23:56:22,291 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 12 states. [2019-01-13 23:56:22,873 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-13 23:56:23,347 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-13 23:56:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:24,778 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2019-01-13 23:56:24,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 23:56:24,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-01-13 23:56:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:24,782 INFO L225 Difference]: With dead ends: 140 [2019-01-13 23:56:24,782 INFO L226 Difference]: Without dead ends: 140 [2019-01-13 23:56:24,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2019-01-13 23:56:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-13 23:56:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 104. [2019-01-13 23:56:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-13 23:56:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2019-01-13 23:56:24,793 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 32 [2019-01-13 23:56:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:24,794 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2019-01-13 23:56:24,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:56:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2019-01-13 23:56:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 23:56:24,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:24,795 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:24,796 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:24,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:24,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1357973587, now seen corresponding path program 1 times [2019-01-13 23:56:24,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:24,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:24,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:24,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:24,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:25,132 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-13 23:56:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:56:25,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:56:25,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:56:25,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:25,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:56:25,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:56:25,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:25,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:25,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:56:25,932 WARN L860 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int)) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base 12))) is different from true [2019-01-13 23:56:25,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 23:56:25,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:25,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:25,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-13 23:56:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2019-01-13 23:56:25,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:56:25,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2019-01-13 23:56:25,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 23:56:25,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 23:56:25,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2019-01-13 23:56:25,989 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 10 states. [2019-01-13 23:56:26,702 WARN L181 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-13 23:56:27,607 WARN L181 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-01-13 23:56:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:28,166 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2019-01-13 23:56:28,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:56:28,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-13 23:56:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:28,169 INFO L225 Difference]: With dead ends: 105 [2019-01-13 23:56:28,169 INFO L226 Difference]: Without dead ends: 105 [2019-01-13 23:56:28,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=39, Invalid=120, Unknown=1, NotChecked=22, Total=182 [2019-01-13 23:56:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-13 23:56:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-13 23:56:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-13 23:56:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2019-01-13 23:56:28,175 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 32 [2019-01-13 23:56:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:28,175 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2019-01-13 23:56:28,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 23:56:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2019-01-13 23:56:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 23:56:28,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:28,178 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:28,180 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:28,180 INFO L82 PathProgramCache]: Analyzing trace with hash 657593987, now seen corresponding path program 1 times [2019-01-13 23:56:28,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:28,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:28,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:28,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:28,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:56:28,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:56:28,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:56:28,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:28,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:56:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:56:28,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:56:28,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-13 23:56:28,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:56:28,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:56:28,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:56:28,617 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 6 states. [2019-01-13 23:56:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:28,711 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2019-01-13 23:56:28,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:56:28,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-01-13 23:56:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:28,713 INFO L225 Difference]: With dead ends: 105 [2019-01-13 23:56:28,713 INFO L226 Difference]: Without dead ends: 105 [2019-01-13 23:56:28,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:56:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-13 23:56:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-13 23:56:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-13 23:56:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2019-01-13 23:56:28,720 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 34 [2019-01-13 23:56:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:28,721 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-01-13 23:56:28,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:56:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2019-01-13 23:56:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 23:56:28,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:28,723 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:28,724 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1094203578, now seen corresponding path program 1 times [2019-01-13 23:56:28,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:28,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:28,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:29,323 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-13 23:56:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:56:29,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:56:29,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:56:29,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:29,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:56:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:56:29,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:56:29,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-13 23:56:29,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 23:56:29,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 23:56:29,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:56:29,622 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 9 states. [2019-01-13 23:56:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:30,005 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2019-01-13 23:56:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:56:30,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-01-13 23:56:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:30,009 INFO L225 Difference]: With dead ends: 115 [2019-01-13 23:56:30,009 INFO L226 Difference]: Without dead ends: 115 [2019-01-13 23:56:30,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:56:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-13 23:56:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2019-01-13 23:56:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-13 23:56:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2019-01-13 23:56:30,017 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 35 [2019-01-13 23:56:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:30,017 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2019-01-13 23:56:30,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 23:56:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2019-01-13 23:56:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 23:56:30,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:30,020 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:30,020 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:30,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:30,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1094203579, now seen corresponding path program 1 times [2019-01-13 23:56:30,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:30,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:30,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:30,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:30,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-13 23:56:30,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:56:30,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:56:30,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:30,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:56:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-13 23:56:30,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:56:30,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-01-13 23:56:30,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:56:30,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:56:30,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:56:30,311 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 5 states. [2019-01-13 23:56:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:30,886 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2019-01-13 23:56:30,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:56:30,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-13 23:56:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:30,890 INFO L225 Difference]: With dead ends: 108 [2019-01-13 23:56:30,890 INFO L226 Difference]: Without dead ends: 108 [2019-01-13 23:56:30,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:56:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-13 23:56:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-01-13 23:56:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-13 23:56:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2019-01-13 23:56:30,902 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 35 [2019-01-13 23:56:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:30,903 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2019-01-13 23:56:30,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:56:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2019-01-13 23:56:30,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 23:56:30,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:30,904 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:30,910 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:30,910 INFO L82 PathProgramCache]: Analyzing trace with hash 439427422, now seen corresponding path program 1 times [2019-01-13 23:56:30,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:30,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:30,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:30,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:30,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-13 23:56:31,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:31,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:56:31,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:56:31,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:56:31,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:56:31,071 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 7 states. [2019-01-13 23:56:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:31,265 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2019-01-13 23:56:31,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:56:31,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-13 23:56:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:31,268 INFO L225 Difference]: With dead ends: 107 [2019-01-13 23:56:31,269 INFO L226 Difference]: Without dead ends: 107 [2019-01-13 23:56:31,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:56:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-13 23:56:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-01-13 23:56:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-13 23:56:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-01-13 23:56:31,274 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 36 [2019-01-13 23:56:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:31,274 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-01-13 23:56:31,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:56:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-01-13 23:56:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 23:56:31,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:31,275 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:31,275 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:31,280 INFO L82 PathProgramCache]: Analyzing trace with hash 439427423, now seen corresponding path program 1 times [2019-01-13 23:56:31,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:31,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:31,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:31,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:31,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:31,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:56:31,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:31,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:56:31,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:56:31,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:56:31,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:56:31,522 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 7 states. [2019-01-13 23:56:31,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:31,747 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2019-01-13 23:56:31,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:56:31,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-13 23:56:31,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:31,750 INFO L225 Difference]: With dead ends: 105 [2019-01-13 23:56:31,750 INFO L226 Difference]: Without dead ends: 105 [2019-01-13 23:56:31,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:56:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-13 23:56:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-13 23:56:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-13 23:56:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2019-01-13 23:56:31,756 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 36 [2019-01-13 23:56:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:31,756 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2019-01-13 23:56:31,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:56:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2019-01-13 23:56:31,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 23:56:31,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:31,760 INFO L402 BasicCegarLoop]: trace histogram [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-01-13 23:56:31,760 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:31,760 INFO L82 PathProgramCache]: Analyzing trace with hash -869726790, now seen corresponding path program 1 times [2019-01-13 23:56:31,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:31,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:31,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:31,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-13 23:56:32,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:32,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 23:56:32,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:56:32,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:56:32,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:56:32,173 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 12 states. [2019-01-13 23:56:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:32,762 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2019-01-13 23:56:32,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 23:56:32,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-13 23:56:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:32,765 INFO L225 Difference]: With dead ends: 111 [2019-01-13 23:56:32,765 INFO L226 Difference]: Without dead ends: 111 [2019-01-13 23:56:32,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:56:32,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-13 23:56:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-01-13 23:56:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 23:56:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-01-13 23:56:32,772 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 45 [2019-01-13 23:56:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:32,773 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-01-13 23:56:32,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:56:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-01-13 23:56:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 23:56:32,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:32,776 INFO L402 BasicCegarLoop]: trace histogram [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-01-13 23:56:32,777 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:32,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:32,777 INFO L82 PathProgramCache]: Analyzing trace with hash -869726789, now seen corresponding path program 1 times [2019-01-13 23:56:32,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:32,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:32,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:32,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-13 23:56:33,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:33,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:56:33,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:56:33,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:56:33,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:56:33,132 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 6 states. [2019-01-13 23:56:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:33,516 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2019-01-13 23:56:33,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:56:33,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-01-13 23:56:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:33,519 INFO L225 Difference]: With dead ends: 129 [2019-01-13 23:56:33,519 INFO L226 Difference]: Without dead ends: 129 [2019-01-13 23:56:33,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:56:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-13 23:56:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2019-01-13 23:56:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-13 23:56:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2019-01-13 23:56:33,526 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 45 [2019-01-13 23:56:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:33,527 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2019-01-13 23:56:33,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:56:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2019-01-13 23:56:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 23:56:33,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:33,530 INFO L402 BasicCegarLoop]: trace histogram [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-01-13 23:56:33,530 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:33,530 INFO L82 PathProgramCache]: Analyzing trace with hash -869726734, now seen corresponding path program 1 times [2019-01-13 23:56:33,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:33,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:33,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:56:33,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:33,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 23:56:33,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:56:33,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:56:33,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:56:33,762 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand 12 states. [2019-01-13 23:56:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:34,293 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2019-01-13 23:56:34,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 23:56:34,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-13 23:56:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:34,296 INFO L225 Difference]: With dead ends: 124 [2019-01-13 23:56:34,297 INFO L226 Difference]: Without dead ends: 124 [2019-01-13 23:56:34,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:56:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-13 23:56:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-01-13 23:56:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-13 23:56:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2019-01-13 23:56:34,306 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 45 [2019-01-13 23:56:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:34,307 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2019-01-13 23:56:34,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:56:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2019-01-13 23:56:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 23:56:34,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:34,310 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:34,311 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:34,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:34,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1383731480, now seen corresponding path program 1 times [2019-01-13 23:56:34,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:34,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:34,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:34,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:34,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-13 23:56:34,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:34,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:56:34,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:56:34,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:56:34,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:56:34,410 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 6 states. [2019-01-13 23:56:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:34,473 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2019-01-13 23:56:34,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:56:34,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-01-13 23:56:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:34,475 INFO L225 Difference]: With dead ends: 108 [2019-01-13 23:56:34,475 INFO L226 Difference]: Without dead ends: 108 [2019-01-13 23:56:34,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:56:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-13 23:56:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-13 23:56:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 23:56:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2019-01-13 23:56:34,481 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 47 [2019-01-13 23:56:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:34,482 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2019-01-13 23:56:34,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:56:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2019-01-13 23:56:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 23:56:34,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:34,483 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-13 23:56:34,483 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:34,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1508555054, now seen corresponding path program 1 times [2019-01-13 23:56:34,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:34,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:34,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:34,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:34,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:56:34,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:56:34,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:56:34,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:35,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:56:35,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:35,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:35,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:56:35,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:35,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:35,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2019-01-13 23:56:35,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:56:35,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:56:35,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:35,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:35,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:35,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-01-13 23:56:35,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-13 23:56:35,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-13 23:56:35,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:35,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:35,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:35,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-01-13 23:56:35,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:35,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2019-01-13 23:56:35,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:35,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 52 [2019-01-13 23:56:35,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:35,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:35,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:35,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:62 [2019-01-13 23:56:36,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:36,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:36,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:36,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 89 [2019-01-13 23:56:36,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:36,072 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 131 [2019-01-13 23:56:36,076 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:56:36,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:36,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:36,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:92 [2019-01-13 23:56:36,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:36,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:36,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 63 [2019-01-13 23:56:36,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:36,687 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2019-01-13 23:56:36,689 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:56:36,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:36,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-01-13 23:56:36,714 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:36,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:36,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:36,744 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:99, output treesize:15 [2019-01-13 23:56:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:56:36,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:56:36,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-01-13 23:56:36,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-13 23:56:36,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-13 23:56:36,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1849, Unknown=0, NotChecked=0, Total=1980 [2019-01-13 23:56:36,894 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 45 states. [2019-01-13 23:56:38,082 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-01-13 23:56:38,501 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-13 23:56:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:39,898 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2019-01-13 23:56:39,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-13 23:56:39,899 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 48 [2019-01-13 23:56:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:39,900 INFO L225 Difference]: With dead ends: 137 [2019-01-13 23:56:39,900 INFO L226 Difference]: Without dead ends: 137 [2019-01-13 23:56:39,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=253, Invalid=2939, Unknown=0, NotChecked=0, Total=3192 [2019-01-13 23:56:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-13 23:56:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2019-01-13 23:56:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-13 23:56:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2019-01-13 23:56:39,907 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 48 [2019-01-13 23:56:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:39,909 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2019-01-13 23:56:39,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-13 23:56:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2019-01-13 23:56:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 23:56:39,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:39,910 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-13 23:56:39,910 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1508555055, now seen corresponding path program 1 times [2019-01-13 23:56:39,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:39,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:39,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:39,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:39,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:56:40,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:56:40,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:56:40,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:40,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:56:41,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:41,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-13 23:56:41,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:41,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:41,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:56:41,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2019-01-13 23:56:41,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:56:41,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:56:41,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:56:41,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:56:41,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-01-13 23:56:41,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-13 23:56:41,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-13 23:56:41,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2019-01-13 23:56:41,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-13 23:56:41,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,700 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:65 [2019-01-13 23:56:41,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 64 [2019-01-13 23:56:41,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:41,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2019-01-13 23:56:41,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 54 [2019-01-13 23:56:41,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:41,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-13 23:56:41,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:41,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:95 [2019-01-13 23:56:42,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:42,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 105 [2019-01-13 23:56:42,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:42,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 137 [2019-01-13 23:56:42,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:42,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:42,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 75 [2019-01-13 23:56:42,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:42,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2019-01-13 23:56:42,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:42,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:42,219 INFO L267 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-01-13 23:56:42,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:146, output treesize:152 [2019-01-13 23:56:42,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:42,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 109 [2019-01-13 23:56:42,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:42,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 34 [2019-01-13 23:56:42,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:42,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:42,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2019-01-13 23:56:42,876 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:42,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:42,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-01-13 23:56:42,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:42,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-13 23:56:42,927 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:42,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:42,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-13 23:56:42,942 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:42,946 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:42,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:42,958 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:166, output treesize:23 [2019-01-13 23:56:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:56:43,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:56:43,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-01-13 23:56:43,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-13 23:56:43,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-13 23:56:43,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1862, Unknown=0, NotChecked=0, Total=1980 [2019-01-13 23:56:43,180 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 45 states. [2019-01-13 23:56:45,300 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 95 [2019-01-13 23:56:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:47,853 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2019-01-13 23:56:47,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-13 23:56:47,854 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 48 [2019-01-13 23:56:47,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:47,859 INFO L225 Difference]: With dead ends: 138 [2019-01-13 23:56:47,859 INFO L226 Difference]: Without dead ends: 138 [2019-01-13 23:56:47,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-01-13 23:56:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-13 23:56:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2019-01-13 23:56:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-13 23:56:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2019-01-13 23:56:47,866 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 48 [2019-01-13 23:56:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:47,866 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2019-01-13 23:56:47,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-13 23:56:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2019-01-13 23:56:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-13 23:56:47,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:47,867 INFO L402 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-01-13 23:56:47,869 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:47,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:47,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1172512454, now seen corresponding path program 2 times [2019-01-13 23:56:47,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:47,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:47,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:47,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:47,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-13 23:56:48,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:48,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:56:48,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:56:48,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:56:48,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:56:48,249 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 7 states. [2019-01-13 23:56:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:48,358 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-01-13 23:56:48,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:56:48,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-01-13 23:56:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:48,361 INFO L225 Difference]: With dead ends: 104 [2019-01-13 23:56:48,361 INFO L226 Difference]: Without dead ends: 104 [2019-01-13 23:56:48,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:56:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-13 23:56:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-13 23:56:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-13 23:56:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-01-13 23:56:48,366 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 51 [2019-01-13 23:56:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:48,366 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-01-13 23:56:48,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:56:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-01-13 23:56:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 23:56:48,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:48,369 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-13 23:56:48,370 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:48,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:48,370 INFO L82 PathProgramCache]: Analyzing trace with hash 600462658, now seen corresponding path program 1 times [2019-01-13 23:56:48,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:48,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:48,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:48,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:56:48,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-13 23:56:48,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:48,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 23:56:48,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:56:48,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:56:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:56:48,792 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 12 states. [2019-01-13 23:56:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:49,329 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2019-01-13 23:56:49,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 23:56:49,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-01-13 23:56:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:49,332 INFO L225 Difference]: With dead ends: 109 [2019-01-13 23:56:49,332 INFO L226 Difference]: Without dead ends: 109 [2019-01-13 23:56:49,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:56:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-13 23:56:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-01-13 23:56:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-13 23:56:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2019-01-13 23:56:49,338 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 58 [2019-01-13 23:56:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:49,338 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2019-01-13 23:56:49,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:56:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2019-01-13 23:56:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 23:56:49,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:49,339 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-13 23:56:49,339 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:49,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:49,339 INFO L82 PathProgramCache]: Analyzing trace with hash 600462659, now seen corresponding path program 1 times [2019-01-13 23:56:49,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:49,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:49,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:49,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:49,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-13 23:56:49,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:56:49,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:56:49,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:49,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:56:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-13 23:56:49,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:56:49,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-13 23:56:49,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:56:49,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:56:49,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:56:49,574 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 5 states. [2019-01-13 23:56:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:49,631 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-01-13 23:56:49,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:56:49,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-13 23:56:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:49,634 INFO L225 Difference]: With dead ends: 114 [2019-01-13 23:56:49,635 INFO L226 Difference]: Without dead ends: 114 [2019-01-13 23:56:49,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:56:49,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-13 23:56:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-13 23:56:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-13 23:56:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-01-13 23:56:49,643 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 58 [2019-01-13 23:56:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:49,645 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-01-13 23:56:49,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:56:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-01-13 23:56:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-13 23:56:49,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:49,647 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:56:49,647 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:49,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:49,648 INFO L82 PathProgramCache]: Analyzing trace with hash -878279738, now seen corresponding path program 1 times [2019-01-13 23:56:49,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:49,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:49,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:49,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:49,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-13 23:56:49,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:49,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:56:49,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:56:49,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:56:49,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:56:49,826 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 7 states. [2019-01-13 23:56:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:49,913 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2019-01-13 23:56:49,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:56:49,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-01-13 23:56:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:49,918 INFO L225 Difference]: With dead ends: 108 [2019-01-13 23:56:49,918 INFO L226 Difference]: Without dead ends: 108 [2019-01-13 23:56:49,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:56:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-13 23:56:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-13 23:56:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 23:56:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-01-13 23:56:49,924 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 59 [2019-01-13 23:56:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:49,924 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-01-13 23:56:49,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:56:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-01-13 23:56:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 23:56:49,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:49,925 INFO L402 BasicCegarLoop]: trace histogram [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-01-13 23:56:49,930 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:49,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1135279415, now seen corresponding path program 2 times [2019-01-13 23:56:49,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:49,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:49,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:49,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:49,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-13 23:56:50,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:50,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:56:50,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:56:50,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:56:50,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:56:50,296 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 6 states. [2019-01-13 23:56:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:50,430 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-01-13 23:56:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:56:50,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-13 23:56:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:50,433 INFO L225 Difference]: With dead ends: 122 [2019-01-13 23:56:50,433 INFO L226 Difference]: Without dead ends: 122 [2019-01-13 23:56:50,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:56:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-13 23:56:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-01-13 23:56:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-13 23:56:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2019-01-13 23:56:50,438 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 66 [2019-01-13 23:56:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:50,440 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2019-01-13 23:56:50,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:56:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2019-01-13 23:56:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 23:56:50,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:50,441 INFO L402 BasicCegarLoop]: trace histogram [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-01-13 23:56:50,441 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:50,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1135279470, now seen corresponding path program 1 times [2019-01-13 23:56:50,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:50,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:50,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:56:50,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-13 23:56:50,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:56:50,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 23:56:50,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:56:50,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:56:50,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:56:50,671 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 12 states. [2019-01-13 23:56:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:56:51,054 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-01-13 23:56:51,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 23:56:51,055 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-01-13 23:56:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:56:51,057 INFO L225 Difference]: With dead ends: 123 [2019-01-13 23:56:51,057 INFO L226 Difference]: Without dead ends: 123 [2019-01-13 23:56:51,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:56:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-13 23:56:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2019-01-13 23:56:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-13 23:56:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2019-01-13 23:56:51,063 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 66 [2019-01-13 23:56:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:56:51,064 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2019-01-13 23:56:51,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:56:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2019-01-13 23:56:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-13 23:56:51,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:56:51,068 INFO L402 BasicCegarLoop]: trace histogram [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-01-13 23:56:51,068 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:56:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:56:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746546, now seen corresponding path program 1 times [2019-01-13 23:56:51,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:56:51,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:56:51,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:51,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:51,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:56:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:51,607 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-13 23:56:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 23:56:53,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:56:53,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:56:53,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:56:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:56:53,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:56:53,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:53,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:53,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:56:53,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:53,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:53,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-13 23:56:53,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:56:53,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:56:53,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:53,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:53,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:53,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-01-13 23:56:53,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-13 23:56:53,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-13 23:56:53,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:53,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:53,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:53,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-13 23:56:53,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-13 23:56:53,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-01-13 23:56:53,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:53,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:53,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:53,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-13 23:56:53,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-13 23:56:53,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:53,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2019-01-13 23:56:53,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:56:53,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:56:53,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:53,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-01-13 23:56:54,741 WARN L181 SmtUtils]: Spent 859.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 23:56:54,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2019-01-13 23:56:54,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2019-01-13 23:56:54,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 23:56:54,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:56:54,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:56:54,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2019-01-13 23:56:54,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-13 23:56:54,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:56:54,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-13 23:56:54,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:54,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:54,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:56:54,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-01-13 23:57:05,323 WARN L181 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-13 23:57:05,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-01-13 23:57:05,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:05,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:05,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:05,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 51 [2019-01-13 23:57:05,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:05,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:05,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:05,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2019-01-13 23:57:05,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2019-01-13 23:57:05,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:05,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-01-13 23:57:05,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:05,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:05,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:05,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-01-13 23:57:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 23:57:05,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:57:05,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 50 [2019-01-13 23:57:05,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-13 23:57:05,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-13 23:57:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2390, Unknown=17, NotChecked=0, Total=2550 [2019-01-13 23:57:05,588 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 51 states. [2019-01-13 23:57:08,419 WARN L181 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-13 23:57:10,295 WARN L181 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-13 23:57:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:57:13,567 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-01-13 23:57:13,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-13 23:57:13,568 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2019-01-13 23:57:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:57:13,570 INFO L225 Difference]: With dead ends: 154 [2019-01-13 23:57:13,570 INFO L226 Difference]: Without dead ends: 154 [2019-01-13 23:57:13,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=416, Invalid=5267, Unknown=17, NotChecked=0, Total=5700 [2019-01-13 23:57:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-13 23:57:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2019-01-13 23:57:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-13 23:57:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2019-01-13 23:57:13,579 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 69 [2019-01-13 23:57:13,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:57:13,579 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2019-01-13 23:57:13,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-13 23:57:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2019-01-13 23:57:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-13 23:57:13,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:57:13,580 INFO L402 BasicCegarLoop]: trace histogram [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-01-13 23:57:13,580 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:57:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:57:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746545, now seen corresponding path program 1 times [2019-01-13 23:57:13,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:57:13,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:57:13,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:57:13,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:57:13,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:57:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:57:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:57:15,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:57:15,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:57:15,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:57:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:57:15,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:57:15,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:15,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:15,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:57:15,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:15,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:15,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-13 23:57:15,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:57:15,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:57:15,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:15,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:15,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:15,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-01-13 23:57:15,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-13 23:57:15,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-13 23:57:15,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:15,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:15,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:15,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-13 23:57:15,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-13 23:57:15,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-01-13 23:57:15,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:15,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:15,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:15,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-13 23:57:17,830 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-01-13 23:57:17,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2019-01-13 23:57:17,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:17,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2019-01-13 23:57:17,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:17,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:17,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-13 23:57:17,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-13 23:57:17,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:17,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:17,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:17,922 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:52 [2019-01-13 23:57:19,984 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-13 23:57:22,102 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-13 23:57:24,168 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-13 23:57:26,232 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-13 23:57:27,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 123 [2019-01-13 23:57:27,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-13 23:57:27,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:27,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:27,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 92 [2019-01-13 23:57:27,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 96 [2019-01-13 23:57:27,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-01-13 23:57:27,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-13 23:57:27,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-13 23:57:27,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:283 [2019-01-13 23:57:27,452 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2019-01-13 23:57:27,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2019-01-13 23:57:27,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:27,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:27,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2019-01-13 23:57:27,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:27,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:27,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2019-01-13 23:57:27,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:27,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-13 23:57:27,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:27,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:27,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:27,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2019-01-13 23:57:27,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:27,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-13 23:57:27,650 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:27,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 23:57:27,662 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:27,670 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:27,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-01-13 23:57:27,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:27,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-13 23:57:27,700 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:27,714 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:27,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-13 23:57:27,734 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:139, output treesize:25 [2019-01-13 23:57:28,870 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_46 Int)) (<= 4 (select |c_#length| v_arrayElimCell_46))) (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))))) is different from true [2019-01-13 23:57:28,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 96 [2019-01-13 23:57:28,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:28,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:28,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:28,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2019-01-13 23:57:28,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:28,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:28,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 102 [2019-01-13 23:57:28,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:28,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:28,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 64 [2019-01-13 23:57:29,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2019-01-13 23:57:29,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 84 [2019-01-13 23:57:29,115 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,141 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 77 [2019-01-13 23:57:29,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-01-13 23:57:29,202 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,226 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-13 23:57:29,270 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:219, output treesize:135 [2019-01-13 23:57:29,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2019-01-13 23:57:29,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-01-13 23:57:29,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-01-13 23:57:29,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-01-13 23:57:29,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2019-01-13 23:57:29,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2019-01-13 23:57:29,670 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:29,684 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:57:29,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2019-01-13 23:57:29,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 23:57:29,740 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:57:29,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2019-01-13 23:57:29,764 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,774 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:57:29,901 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:155, output treesize:13 [2019-01-13 23:57:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2019-01-13 23:57:29,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:57:29,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 53 [2019-01-13 23:57:29,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-13 23:57:29,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-13 23:57:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2615, Unknown=1, NotChecked=102, Total=2862 [2019-01-13 23:57:29,942 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 54 states. [2019-01-13 23:57:35,257 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-01-13 23:57:39,430 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-01-13 23:57:47,611 WARN L181 SmtUtils]: Spent 8.10 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-01-13 23:57:51,702 WARN L181 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-13 23:57:55,833 WARN L181 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-13 23:58:03,384 WARN L181 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-01-13 23:58:04,201 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-01-13 23:58:04,582 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-13 23:58:04,767 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-01-13 23:58:07,557 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-01-13 23:58:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:58:08,840 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2019-01-13 23:58:08,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-13 23:58:08,842 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 69 [2019-01-13 23:58:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:58:08,844 INFO L225 Difference]: With dead ends: 151 [2019-01-13 23:58:08,844 INFO L226 Difference]: Without dead ends: 151 [2019-01-13 23:58:08,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=398, Invalid=5767, Unknown=1, NotChecked=154, Total=6320 [2019-01-13 23:58:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-13 23:58:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2019-01-13 23:58:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-13 23:58:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2019-01-13 23:58:08,850 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 69 [2019-01-13 23:58:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:58:08,851 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2019-01-13 23:58:08,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-13 23:58:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2019-01-13 23:58:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-13 23:58:08,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:58:08,856 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-13 23:58:08,857 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:58:08,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:58:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746490, now seen corresponding path program 1 times [2019-01-13 23:58:08,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:58:08,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:58:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:08,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-13 23:58:08,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:58:08,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:58:08,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:58:08,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:58:08,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:58:08,999 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand 7 states. [2019-01-13 23:58:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:58:09,062 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-01-13 23:58:09,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:58:09,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-01-13 23:58:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:58:09,066 INFO L225 Difference]: With dead ends: 111 [2019-01-13 23:58:09,066 INFO L226 Difference]: Without dead ends: 111 [2019-01-13 23:58:09,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:58:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-13 23:58:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-13 23:58:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-13 23:58:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2019-01-13 23:58:09,069 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 69 [2019-01-13 23:58:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:58:09,070 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2019-01-13 23:58:09,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:58:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2019-01-13 23:58:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 23:58:09,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:58:09,071 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:58:09,071 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:58:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:58:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash 493143767, now seen corresponding path program 1 times [2019-01-13 23:58:09,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:58:09,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:58:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:09,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-13 23:58:09,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:58:09,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 23:58:09,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:58:09,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:58:09,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:58:09,315 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 12 states. [2019-01-13 23:58:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:58:09,715 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2019-01-13 23:58:09,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 23:58:09,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-01-13 23:58:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:58:09,718 INFO L225 Difference]: With dead ends: 131 [2019-01-13 23:58:09,718 INFO L226 Difference]: Without dead ends: 131 [2019-01-13 23:58:09,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:58:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-13 23:58:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2019-01-13 23:58:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-13 23:58:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-01-13 23:58:09,722 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 91 [2019-01-13 23:58:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:58:09,722 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-01-13 23:58:09,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:58:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-01-13 23:58:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 23:58:09,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:58:09,723 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:58:09,724 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:58:09,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:58:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 493143768, now seen corresponding path program 1 times [2019-01-13 23:58:09,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:58:09,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:58:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:09,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-13 23:58:10,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:58:10,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 23:58:10,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:58:10,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:58:10,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:58:10,147 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 12 states. [2019-01-13 23:58:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:58:10,605 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-01-13 23:58:10,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 23:58:10,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-01-13 23:58:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:58:10,609 INFO L225 Difference]: With dead ends: 112 [2019-01-13 23:58:10,609 INFO L226 Difference]: Without dead ends: 112 [2019-01-13 23:58:10,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:58:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-13 23:58:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-13 23:58:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-13 23:58:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-01-13 23:58:10,613 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 91 [2019-01-13 23:58:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:58:10,613 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-01-13 23:58:10,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:58:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-01-13 23:58:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 23:58:10,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:58:10,614 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 23:58:10,615 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:58:10,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:58:10,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1837028533, now seen corresponding path program 1 times [2019-01-13 23:58:10,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:58:10,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:58:10,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:10,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:10,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-13 23:58:10,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:58:10,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:58:10,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:10,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:58:11,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-13 23:58:11,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-13 23:58:11,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:11,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:11,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:11,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-13 23:58:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-13 23:58:11,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:58:11,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2019-01-13 23:58:11,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:58:11,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:58:11,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:58:11,108 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 12 states. [2019-01-13 23:58:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:58:11,582 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-01-13 23:58:11,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 23:58:11,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-01-13 23:58:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:58:11,585 INFO L225 Difference]: With dead ends: 129 [2019-01-13 23:58:11,585 INFO L226 Difference]: Without dead ends: 129 [2019-01-13 23:58:11,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-01-13 23:58:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-13 23:58:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 112. [2019-01-13 23:58:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-13 23:58:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2019-01-13 23:58:11,596 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 94 [2019-01-13 23:58:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:58:11,596 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2019-01-13 23:58:11,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:58:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2019-01-13 23:58:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 23:58:11,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:58:11,602 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 23:58:11,603 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:58:11,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:58:11,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1837028532, now seen corresponding path program 1 times [2019-01-13 23:58:11,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:58:11,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:58:11,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:11,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:11,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-13 23:58:13,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:58:13,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:58:13,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:13,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:58:13,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:13,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:13,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:58:13,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:13,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:13,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-01-13 23:58:14,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:58:14,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:58:14,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:58:14,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:58:14,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2019-01-13 23:58:14,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2019-01-13 23:58:14,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 23:58:14,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-13 23:58:14,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:58:14,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,146 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:58:14,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 47 [2019-01-13 23:58:14,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2019-01-13 23:58:14,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 44 [2019-01-13 23:58:14,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-01-13 23:58:14,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:62 [2019-01-13 23:58:14,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:14,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2019-01-13 23:58:14,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:14,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 99 [2019-01-13 23:58:14,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:14,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2019-01-13 23:58:14,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:14,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2019-01-13 23:58:14,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:14,529 INFO L267 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-01-13 23:58:14,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:101, output treesize:109 [2019-01-13 23:58:15,793 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (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-01-13 23:58:15,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:15,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:15,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 94 [2019-01-13 23:58:15,825 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 70 [2019-01-13 23:58:15,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-01-13 23:58:16,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2019-01-13 23:58:16,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:17,003 INFO L303 Elim1Store]: Index analysis took 130 ms [2019-01-13 23:58:17,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 72 [2019-01-13 23:58:17,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-13 23:58:17,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 76 [2019-01-13 23:58:17,045 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-13 23:58:17,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2019-01-13 23:58:17,078 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-13 23:58:17,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-13 23:58:17,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2019-01-13 23:58:17,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 35 [2019-01-13 23:58:17,396 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2019-01-13 23:58:17,431 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-13 23:58:17,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2019-01-13 23:58:17,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 35 [2019-01-13 23:58:17,482 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2019-01-13 23:58:17,520 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-13 23:58:17,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2019-01-13 23:58:17,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 35 [2019-01-13 23:58:17,554 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2019-01-13 23:58:17,591 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-13 23:58:17,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2019-01-13 23:58:17,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 35 [2019-01-13 23:58:17,644 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2019-01-13 23:58:17,681 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-13 23:58:17,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 13 xjuncts. [2019-01-13 23:58:17,929 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:132, output treesize:343 [2019-01-13 23:58:18,808 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0))))) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-01-13 23:58:18,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2019-01-13 23:58:18,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:18,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-13 23:58:18,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:18,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:18,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2019-01-13 23:58:18,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:18,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:18,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2019-01-13 23:58:18,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:18,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:19,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2019-01-13 23:58:19,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:19,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:19,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2019-01-13 23:58:19,014 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:19,026 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:19,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-13 23:58:19,060 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:133, output treesize:67 [2019-01-13 23:58:20,372 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2019-01-13 23:58:21,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-01-13 23:58:21,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-13 23:58:21,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:21,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2019-01-13 23:58:21,051 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:21,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:21,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-01-13 23:58:21,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-13 23:58:21,105 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:21,119 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:21,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2019-01-13 23:58:21,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-01-13 23:58:21,172 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:21,185 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:21,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2019-01-13 23:58:21,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2019-01-13 23:58:21,238 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:21,245 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:21,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:21,279 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:145, output treesize:11 [2019-01-13 23:58:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-01-13 23:58:21,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:58:21,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 40] total 65 [2019-01-13 23:58:21,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-13 23:58:21,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-13 23:58:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3817, Unknown=4, NotChecked=250, Total=4290 [2019-01-13 23:58:21,367 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 66 states. [2019-01-13 23:58:23,096 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-01-13 23:58:25,616 WARN L181 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-01-13 23:58:26,921 WARN L181 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-13 23:58:27,525 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-01-13 23:58:27,923 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-01-13 23:58:28,870 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 81 [2019-01-13 23:58:29,151 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 76 [2019-01-13 23:58:29,784 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-13 23:58:30,085 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-13 23:58:30,349 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-13 23:58:30,931 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-13 23:58:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:58:31,581 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2019-01-13 23:58:31,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-13 23:58:31,583 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 94 [2019-01-13 23:58:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:58:31,585 INFO L225 Difference]: With dead ends: 126 [2019-01-13 23:58:31,585 INFO L226 Difference]: Without dead ends: 126 [2019-01-13 23:58:31,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=621, Invalid=7939, Unknown=4, NotChecked=366, Total=8930 [2019-01-13 23:58:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-13 23:58:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2019-01-13 23:58:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-13 23:58:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2019-01-13 23:58:31,593 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 94 [2019-01-13 23:58:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:58:31,594 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2019-01-13 23:58:31,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-13 23:58:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2019-01-13 23:58:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 23:58:31,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:58:31,596 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 23:58:31,596 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:58:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:58:31,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1804537762, now seen corresponding path program 1 times [2019-01-13 23:58:31,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:58:31,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:58:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:31,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-13 23:58:32,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:58:32,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 23:58:32,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:58:32,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:58:32,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:58:32,022 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 12 states. [2019-01-13 23:58:32,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:58:32,243 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2019-01-13 23:58:32,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 23:58:32,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-01-13 23:58:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:58:32,246 INFO L225 Difference]: With dead ends: 116 [2019-01-13 23:58:32,246 INFO L226 Difference]: Without dead ends: 114 [2019-01-13 23:58:32,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:58:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-13 23:58:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-13 23:58:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-13 23:58:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2019-01-13 23:58:32,251 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 94 [2019-01-13 23:58:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:58:32,254 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2019-01-13 23:58:32,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:58:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2019-01-13 23:58:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 23:58:32,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:58:32,255 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 23:58:32,255 INFO L423 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:58:32,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:58:32,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1113311010, now seen corresponding path program 1 times [2019-01-13 23:58:32,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:58:32,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:58:32,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:32,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:32,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-13 23:58:32,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:58:32,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 23:58:32,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:58:32,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:58:32,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 23:58:32,953 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 12 states. [2019-01-13 23:58:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:58:33,273 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-01-13 23:58:33,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 23:58:33,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-01-13 23:58:33,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:58:33,277 INFO L225 Difference]: With dead ends: 113 [2019-01-13 23:58:33,277 INFO L226 Difference]: Without dead ends: 113 [2019-01-13 23:58:33,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:58:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-13 23:58:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-13 23:58:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-13 23:58:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2019-01-13 23:58:33,287 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 95 [2019-01-13 23:58:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:58:33,288 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2019-01-13 23:58:33,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:58:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2019-01-13 23:58:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 23:58:33,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:58:33,289 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 23:58:33,289 INFO L423 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:58:33,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:58:33,289 INFO L82 PathProgramCache]: Analyzing trace with hash -443599901, now seen corresponding path program 1 times [2019-01-13 23:58:33,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:58:33,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:58:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:33,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-13 23:58:34,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:58:34,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:58:34,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:34,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:58:34,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 23:58:34,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-13 23:58:34,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:34,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:34,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:58:34,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-01-13 23:58:34,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:58:34,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:58:34,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-01-13 23:58:34,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-13 23:58:34,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-13 23:58:34,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:58:34,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-01-13 23:58:34,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-13 23:58:34,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-01-13 23:58:34,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 23:58:34,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-01-13 23:58:34,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-13 23:58:34,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:34,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2019-01-13 23:58:34,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:34,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:58:34,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2019-01-13 23:58:35,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2019-01-13 23:58:35,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-13 23:58:35,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:35,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:35,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-13 23:58:35,235 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:35,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:35,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:35,240 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:3 [2019-01-13 23:58:36,033 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))))) is different from true [2019-01-13 23:58:36,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2019-01-13 23:58:36,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2019-01-13 23:58:36,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 23:58:36,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:58:36,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:58:36,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2019-01-13 23:58:36,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-13 23:58:36,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:36,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-13 23:58:36,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:36,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:36,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:36,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-01-13 23:58:36,793 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-01-13 23:58:36,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-01-13 23:58:36,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:36,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:36,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:36,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 51 [2019-01-13 23:58:36,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:36,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:36,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:36,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:31 [2019-01-13 23:58:39,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2019-01-13 23:58:39,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:39,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2019-01-13 23:58:39,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 23:58:39,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:58:39,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:39,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-01-13 23:58:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2019-01-13 23:58:39,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:58:39,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 53 [2019-01-13 23:58:39,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-13 23:58:39,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-13 23:58:39,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2507, Unknown=2, NotChecked=202, Total=2862 [2019-01-13 23:58:39,576 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 54 states. [2019-01-13 23:58:45,576 WARN L181 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-01-13 23:58:48,199 WARN L181 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2019-01-13 23:58:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:58:49,994 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-01-13 23:58:49,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-13 23:58:49,996 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 97 [2019-01-13 23:58:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:58:49,999 INFO L225 Difference]: With dead ends: 121 [2019-01-13 23:58:49,999 INFO L226 Difference]: Without dead ends: 121 [2019-01-13 23:58:50,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 69 SyntacticMatches, 12 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=448, Invalid=6037, Unknown=3, NotChecked=318, Total=6806 [2019-01-13 23:58:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-13 23:58:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-01-13 23:58:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-13 23:58:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-01-13 23:58:50,008 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 97 [2019-01-13 23:58:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:58:50,012 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-01-13 23:58:50,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-13 23:58:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-01-13 23:58:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 23:58:50,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:58:50,013 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 23:58:50,013 INFO L423 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:58:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:58:50,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1064083314, now seen corresponding path program 1 times [2019-01-13 23:58:50,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:58:50,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:58:50,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:50,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:50,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:58:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-13 23:58:50,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:58:50,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:58:50,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:58:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:58:51,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:58:51,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:51,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:51,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:58:51,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:51,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:51,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-13 23:58:51,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:58:51,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:58:51,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:51,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:51,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:51,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-13 23:58:51,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-13 23:58:51,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-13 23:58:51,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:51,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:51,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:58:51,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-01-13 23:58:51,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-13 23:58:51,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-01-13 23:58:51,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:51,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:51,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 23:58:51,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2019-01-13 23:58:51,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-13 23:58:51,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:51,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2019-01-13 23:58:51,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:51,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:51,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:58:51,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-01-13 23:58:52,815 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))))) is different from true [2019-01-13 23:58:52,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:52,821 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:58:52,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 73 [2019-01-13 23:58:52,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 45 [2019-01-13 23:58:52,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 23:58:52,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:58:52,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:58:52,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:60 [2019-01-13 23:58:53,555 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-01-13 23:58:53,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-13 23:58:53,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:53,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:58:53,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-01-13 23:58:53,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:58:53,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:53,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:58:53,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:23 [2019-01-13 23:59:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2019-01-13 23:59:06,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:59:06,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 56 [2019-01-13 23:59:06,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-13 23:59:06,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-13 23:59:06,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2691, Unknown=2, NotChecked=210, Total=3080 [2019-01-13 23:59:06,123 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 56 states. [2019-01-13 23:59:29,392 WARN L181 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2019-01-13 23:59:38,083 WARN L181 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2019-01-13 23:59:41,439 WARN L181 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-01-13 23:59:42,073 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-13 23:59:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:59:42,483 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-13 23:59:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-13 23:59:42,484 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 100 [2019-01-13 23:59:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:59:42,486 INFO L225 Difference]: With dead ends: 117 [2019-01-13 23:59:42,486 INFO L226 Difference]: Without dead ends: 112 [2019-01-13 23:59:42,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 71 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=434, Invalid=5269, Unknown=5, NotChecked=298, Total=6006 [2019-01-13 23:59:42,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-13 23:59:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-01-13 23:59:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-13 23:59:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-01-13 23:59:42,493 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 100 [2019-01-13 23:59:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:59:42,493 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-01-13 23:59:42,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-13 23:59:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-01-13 23:59:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-13 23:59:42,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:59:42,494 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-13 23:59:42,495 INFO L423 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-13 23:59:42,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:59:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash 329925328, now seen corresponding path program 1 times [2019-01-13 23:59:42,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:59:42,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:59:42,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:59:42,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:59:42,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:59:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:59:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-13 23:59:44,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:59:44,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:59:44,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:59:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:59:44,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:59:44,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:44,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:44,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:59:44,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:44,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:44,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-13 23:59:44,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:59:44,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:59:44,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:44,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:44,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:44,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-01-13 23:59:45,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-13 23:59:45,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-13 23:59:45,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:45,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:45,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:45,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-13 23:59:45,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:45,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-01-13 23:59:45,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:45,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2019-01-13 23:59:45,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:45,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:45,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2019-01-13 23:59:45,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 23:59:45,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:45,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:45,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:45,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2019-01-13 23:59:45,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:45,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:45,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:45,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 76 [2019-01-13 23:59:45,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:45,912 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 114 [2019-01-13 23:59:45,914 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:59:45,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:45,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:45,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2019-01-13 23:59:45,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-13 23:59:45,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:46,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:46,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:46,051 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:73 [2019-01-13 23:59:47,682 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|)) (.cse1 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))) (= (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|) (<= (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.offset)))) is different from true [2019-01-13 23:59:47,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:47,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:47,691 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:59:47,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:47,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:47,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 145 [2019-01-13 23:59:47,764 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 111 [2019-01-13 23:59:47,773 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2019-01-13 23:59:47,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-13 23:59:47,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:47,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:47,964 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:59:47,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:47,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:47,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 125 [2019-01-13 23:59:47,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:48,045 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 55 [2019-01-13 23:59:48,046 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:59:48,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:48,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:48,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:48,174 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:59:48,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:48,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 104 [2019-01-13 23:59:48,195 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:59:48,224 INFO L478 Elim1Store]: Elim1 applied some 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 3 case distinctions, treesize of input 36 treesize of output 43 [2019-01-13 23:59:48,227 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-13 23:59:48,262 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:48,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:48,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:48,270 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:59:48,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 112 [2019-01-13 23:59:48,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 17 [2019-01-13 23:59:48,304 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-13 23:59:48,335 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:59:48,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 23:59:48,423 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:167 [2019-01-13 23:59:49,779 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset)))) is different from true [2019-01-13 23:59:49,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:49,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:49,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:49,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 126 [2019-01-13 23:59:49,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:49,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:49,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:49,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:49,829 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 82 [2019-01-13 23:59:49,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:59:49,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:50,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 96 [2019-01-13 23:59:50,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,105 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 95 [2019-01-13 23:59:50,107 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:59:50,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:50,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 106 [2019-01-13 23:59:50,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,349 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 84 [2019-01-13 23:59:50,350 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:59:50,399 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:50,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 119 [2019-01-13 23:59:50,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,554 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 117 [2019-01-13 23:59:50,556 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:59:50,620 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:50,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 88 [2019-01-13 23:59:50,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-13 23:59:50,725 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:50,750 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:50,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2019-01-13 23:59:50,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:50,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 45 [2019-01-13 23:59:50,850 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:50,873 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:50,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 23:59:50,937 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:290, output treesize:167 [2019-01-13 23:59:52,534 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-13 23:59:52,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:52,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:52,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:52,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 62 [2019-01-13 23:59:52,653 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 51 [2019-01-13 23:59:52,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-01-13 23:59:52,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:52,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 63 [2019-01-13 23:59:52,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2019-01-13 23:59:52,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 59 [2019-01-13 23:59:52,795 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2019-01-13 23:59:52,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2019-01-13 23:59:52,812 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-13 23:59:52,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 63 [2019-01-13 23:59:52,856 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2019-01-13 23:59:53,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 11 xjuncts. [2019-01-13 23:59:53,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2019-01-13 23:59:53,351 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2019-01-13 23:59:53,352 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-13 23:59:53,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2019-01-13 23:59:53,383 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,399 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2019-01-13 23:59:53,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 11 [2019-01-13 23:59:53,414 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:59:53,438 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2019-01-13 23:59:53,452 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:59:53,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2019-01-13 23:59:53,491 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2019-01-13 23:59:53,493 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-13 23:59:53,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2019-01-13 23:59:53,518 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,529 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2019-01-13 23:59:53,561 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2019-01-13 23:59:53,563 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-13 23:59:53,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2019-01-13 23:59:53,588 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,597 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2019-01-13 23:59:53,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,628 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 37 [2019-01-13 23:59:53,630 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:59:53,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:59:53,657 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,668 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2019-01-13 23:59:53,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,703 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 37 [2019-01-13 23:59:53,705 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:59:53,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:59:53,722 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,729 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2019-01-13 23:59:53,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,761 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 37 [2019-01-13 23:59:53,763 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:59:53,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-13 23:59:53,781 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,789 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-01-13 23:59:53,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:59:53,802 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2019-01-13 23:59:53,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 11 [2019-01-13 23:59:53,820 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,829 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:59:53,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-01-13 23:59:53,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 11 [2019-01-13 23:59:53,839 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:59:53,858 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2019-01-13 23:59:53,867 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:59:53,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-01-13 23:59:53,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:59:53,897 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2019-01-13 23:59:53,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 11 [2019-01-13 23:59:53,917 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,926 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:59:53,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2019-01-13 23:59:53,951 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2019-01-13 23:59:53,953 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-13 23:59:53,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:59:53,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2019-01-13 23:59:53,980 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-13 23:59:53,989 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:59:54,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 23:59:54,253 INFO L202 ElimStorePlain]: Needed 41 recursive calls to eliminate 6 variables, input treesize:263, output treesize:43 [2019-01-13 23:59:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-01-13 23:59:54,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:59:54,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 62 [2019-01-13 23:59:54,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-13 23:59:54,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-13 23:59:54,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3361, Unknown=3, NotChecked=234, Total=3782 [2019-01-13 23:59:54,659 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 62 states. [2019-01-13 23:59:56,677 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-01-14 00:00:01,272 WARN L181 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-01-14 00:00:02,007 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-14 00:00:05,062 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 61 DAG size of output: 28 [2019-01-14 00:00:06,014 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 00:00:06,300 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 00:00:06,560 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 00:00:07,000 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-01-14 00:00:07,425 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-01-14 00:00:07,796 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-01-14 00:00:08,273 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-01-14 00:00:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:00:08,534 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-14 00:00:08,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 00:00:08,536 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 100 [2019-01-14 00:00:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:00:08,538 INFO L225 Difference]: With dead ends: 103 [2019-01-14 00:00:08,538 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 00:00:08,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 65 SyntacticMatches, 15 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=515, Invalid=6970, Unknown=5, NotChecked=342, Total=7832 [2019-01-14 00:00:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 00:00:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-14 00:00:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 00:00:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2019-01-14 00:00:08,542 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 100 [2019-01-14 00:00:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:00:08,542 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2019-01-14 00:00:08,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-14 00:00:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2019-01-14 00:00:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-14 00:00:08,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:00:08,543 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-14 00:00:08,547 INFO L423 AbstractCegarLoop]: === Iteration 37 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-14 00:00:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:00:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash -769380864, now seen corresponding path program 1 times [2019-01-14 00:00:08,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:00:08,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:00:08,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:00:08,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:00:08,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:00:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:00:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:00:09,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:00:09,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:00:09,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:00:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:00:09,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:00:09,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:09,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2019-01-14 00:00:09,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:09,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:09,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 00:00:09,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:00:09,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 00:00:09,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:38 [2019-01-14 00:00:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-14 00:00:10,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:00:10,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 7] total 40 [2019-01-14 00:00:10,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-14 00:00:10,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-14 00:00:10,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 00:00:10,126 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand 41 states. [2019-01-14 00:00:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:00:12,775 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2019-01-14 00:00:12,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 00:00:12,776 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 102 [2019-01-14 00:00:12,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:00:12,778 INFO L225 Difference]: With dead ends: 102 [2019-01-14 00:00:12,778 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 00:00:12,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=329, Invalid=3331, Unknown=0, NotChecked=0, Total=3660 [2019-01-14 00:00:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 00:00:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-14 00:00:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 00:00:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2019-01-14 00:00:12,782 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 102 [2019-01-14 00:00:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:00:12,782 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2019-01-14 00:00:12,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-14 00:00:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2019-01-14 00:00:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-14 00:00:12,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:00:12,783 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-14 00:00:12,784 INFO L423 AbstractCegarLoop]: === Iteration 38 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-14 00:00:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:00:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1463468233, now seen corresponding path program 1 times [2019-01-14 00:00:12,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:00:12,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:00:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:00:12,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:00:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:00:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:00:13,175 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2019-01-14 00:00:13,466 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-14 00:00:13,958 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-14 00:00:14,288 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-14 00:00:14,601 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-01-14 00:00:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 00:00:15,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:00:15,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:00:15,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:00:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:00:15,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:00:16,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:16,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:16,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:40 [2019-01-14 00:00:16,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 00:00:16,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:00:16,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:16,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:00:16,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:16,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2019-01-14 00:00:16,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:16,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 00:00:16,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:00:16,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:16,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:00:16,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:16,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:53 [2019-01-14 00:00:16,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:16,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-14 00:00:16,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-01-14 00:00:16,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:16,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:00:16,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:16,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:60 [2019-01-14 00:00:16,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:16,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-01-14 00:00:16,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:16,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 62 [2019-01-14 00:00:16,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:16,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:00:16,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:16,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:71 [2019-01-14 00:00:17,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:17,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 44 [2019-01-14 00:00:17,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:17,248 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:00:17,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 42 [2019-01-14 00:00:17,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:17,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:00:17,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2019-01-14 00:00:17,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:17,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-01-14 00:00:17,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:17,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:00:17,321 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:17,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:00:17,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:17,336 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:74, output treesize:18 [2019-01-14 00:00:24,904 WARN L181 SmtUtils]: Spent 888.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 00:00:24,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:24,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 79 [2019-01-14 00:00:24,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2019-01-14 00:00:24,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:00:24,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:00:25,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-14 00:00:25,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:116, output treesize:160 [2019-01-14 00:00:25,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:25,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2019-01-14 00:00:25,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:25,220 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:00:25,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2019-01-14 00:00:25,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:25,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:00:25,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-01-14 00:00:25,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:25,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-01-14 00:00:25,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:25,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:00:25,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:25,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:61, output treesize:18 [2019-01-14 00:00:34,611 WARN L181 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 00:00:34,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2019-01-14 00:00:34,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:34,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:34,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:34,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-01-14 00:00:34,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:34,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:00:34,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:34,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:94, output treesize:72 [2019-01-14 00:00:34,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:34,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-14 00:00:34,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:34,837 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:00:34,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2019-01-14 00:00:34,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:34,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:00:34,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:34,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:42 [2019-01-14 00:00:35,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:35,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2019-01-14 00:00:35,187 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:00:35,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2019-01-14 00:00:35,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:35,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:00:35,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:35,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-14 00:00:35,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-01-14 00:00:35,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:35,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:35,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:31 [2019-01-14 00:00:37,780 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 00:00:54,282 WARN L181 SmtUtils]: Spent 2.46 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 00:00:56,293 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((main_~s~0.offset Int) (v_main_~s~0.base_BEFORE_CALL_35 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_35))) (let ((.cse1 (select .cse0 main_~s~0.offset))) (and (= (select .cse0 (+ main_~s~0.offset 4)) .cse1) (not (= .cse1 v_main_~s~0.base_BEFORE_CALL_35)) (<= 0 main_~s~0.offset) (<= main_~s~0.offset 0))))) (exists ((dll_circular_destroy_~head.offset Int)) (and (= (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_dll_circular_destroy_#in~head.base|) dll_circular_destroy_~head.offset) 0) |c_dll_circular_destroy_#in~head.base| 0) |c_#valid|) (<= dll_circular_destroy_~head.offset 0) (<= 0 dll_circular_destroy_~head.offset)))) is different from true [2019-01-14 00:00:56,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 67 [2019-01-14 00:00:56,336 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:00:56,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:56,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:56,344 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:00:56,345 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:00:56,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 64 [2019-01-14 00:00:56,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:56,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:56,409 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:00:56,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2019-01-14 00:00:56,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:00:56,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:00:56,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-01-14 00:00:56,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:00:56,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:00:56,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-01-14 00:00:56,522 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:101, output treesize:75 [2019-01-14 00:01:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 12 refuted. 2 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 00:01:29,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:01:29,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 64 [2019-01-14 00:01:29,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-14 00:01:29,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-14 00:01:29,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3750, Unknown=54, NotChecked=124, Total=4160 [2019-01-14 00:01:29,626 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 65 states. [2019-01-14 00:01:52,616 WARN L181 SmtUtils]: Spent 966.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-01-14 00:01:58,489 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-01-14 00:01:59,714 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-01-14 00:02:00,297 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-01-14 00:02:06,955 WARN L181 SmtUtils]: Spent 942.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 00:02:23,564 WARN L181 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 00:02:47,886 WARN L181 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-01-14 00:02:56,228 WARN L181 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-14 00:03:01,652 WARN L181 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-14 00:03:08,440 WARN L181 SmtUtils]: Spent 5.42 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-01-14 00:03:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:03:09,827 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2019-01-14 00:03:09,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 00:03:09,827 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 106 [2019-01-14 00:03:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:03:09,828 INFO L225 Difference]: With dead ends: 101 [2019-01-14 00:03:09,828 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 00:03:09,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 78 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1956 ImplicationChecksByTransitivity, 104.3s TimeCoverageRelationStatistics Valid=468, Invalid=6444, Unknown=64, NotChecked=164, Total=7140 [2019-01-14 00:03:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 00:03:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 00:03:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 00:03:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 00:03:09,829 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-01-14 00:03:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:03:09,830 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 00:03:09,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-14 00:03:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 00:03:09,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 00:03:09,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:03:09 BoogieIcfgContainer [2019-01-14 00:03:09,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:03:09,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:03:09,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:03:09,837 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:03:09,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:56:17" (3/4) ... [2019-01-14 00:03:09,841 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 00:03:09,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 00:03:09,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 00:03:09,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2019-01-14 00:03:09,849 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 00:03:09,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 00:03:09,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 00:03:09,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2019-01-14 00:03:09,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2019-01-14 00:03:09,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-14 00:03:09,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2019-01-14 00:03:09,857 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-01-14 00:03:09,858 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-14 00:03:09,858 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 00:03:09,930 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:03:09,931 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:03:09,932 INFO L168 Benchmark]: Toolchain (without parser) took 414073.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.6 MB). Free memory was 947.3 MB in the beginning and 975.4 MB in the end (delta: -28.1 MB). Peak memory consumption was 221.5 MB. Max. memory is 11.5 GB. [2019-01-14 00:03:09,934 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:03:09,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-01-14 00:03:09,935 INFO L168 Benchmark]: Boogie Preprocessor took 70.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 00:03:09,935 INFO L168 Benchmark]: RCFGBuilder took 1167.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:03:09,935 INFO L168 Benchmark]: TraceAbstraction took 412087.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 1.0 GB in the beginning and 984.8 MB in the end (delta: 55.2 MB). Peak memory consumption was 184.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:03:09,936 INFO L168 Benchmark]: Witness Printer took 94.43 ms. Allocated memory is still 1.3 GB. Free memory was 984.8 MB in the beginning and 975.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:03:09,939 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 647.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1167.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 412087.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 1.0 GB in the beginning and 984.8 MB in the end (delta: 55.2 MB). Peak memory consumption was 184.7 MB. Max. memory is 11.5 GB. * Witness Printer took 94.43 ms. Allocated memory is still 1.3 GB. Free memory was 984.8 MB in the beginning and 975.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: 579]: 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: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: 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: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: 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: 571]: 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: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 33 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 120 locations, 33 error locations. SAFE Result, 412.0s OverallTime, 38 OverallIterations, 3 TraceHistogramMax, 240.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2931 SDtfs, 3236 SDslu, 17590 SDs, 0 SdLazy, 30479 SolverSat, 872 SolverUnsat, 89 SolverUnknown, 0 SolverNotchecked, 130.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2015 GetRequests, 915 SyntacticMatches, 104 SemanticMatches, 996 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 12474 ImplicationChecksByTransitivity, 258.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 236 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 167.8s InterpolantComputationTime, 3404 NumberOfCodeBlocks, 3404 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 3349 ConstructedInterpolants, 290 QuantifiedInterpolants, 3893201 SizeOfPredicates, 274 NumberOfNonLiveVariables, 5697 ConjunctsInSsa, 1035 ConjunctsInUnsatCore, 55 InterpolantComputations, 21 PerfectInterpolantSequences, 728/1094 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...